Maximum Subsequence Score

Problem Statement:- You are given two 0-indexed integer arrays nums1 and nums2 of equal length n and a positive integer k. You must choose a subsequence of indices from nums1 of length k. For chosen indices i₀, i₁, ..., i<sub>k ...