Subsequence Sum After Capping Elements

You are given an integer array nums of size n and a positive integer k.
An array is said to be capped by value x if every element in it is replaced by min(nums[i], x).
For each integer x in the range 1 to n, determine whether it is possible to select a subsequence from the array capped by x such that the sum of the selected elements equals k.
Return a 0-indexed boolean array answer of size n, where answer[i] is:
• true if it’s possible when using x = i + 1
• false otherwise.