Given an array of numbers, you are required to check if it is possible to partition the array into some subsequences of length k each, such that:Each element in the array occurs in exactly one subsquenceAll the numbers in a subsequence are distinctElements in the array having the same value must be in different subsequencesIs possible to partition the array satisfying the above conditions? If it is possible, return true, else return falseExampleExample1:Input:A:[1, 2, 3, 4]k = 2output: trueExplanation:Then one possible way is to choose the first 2 elements of the array {1, 2} as the first subsequence, the next 2 elements {3, 4} as the next subsquence. So the answer is trueExample2:Input:A: [1, 2, 2, 3]k: 3output: false