please match this 3 case exactly!

Using python: you should output one of these subsets, otherwise, output No such a subset!"- output in non-decreasing order. Using Recursion and divide and conquer approach Only one output is needed Case 1 e Case 2 "input.txt" T = {2,3,5,6,8,10) "input.txt" 6 // containing the elements of the set T- 6 //the maximum subset size 10 // sum of the integers in subset le 5 1 3 10 24 le 3e 4 se 64 12 24 8 10 output.txt output.txt 2,3,5 1,9 2,8 (Either one of the following outputs will 10 be considered correct, just one and (Either one of the following outputs will non-decreasing order.) be considered correct, just one and non-decreasing order. Case 3 21 10 le 16 34 7 6 output.txt le 4,6 3,7 (Either one of the following outputs will be considered correct, just one and non-decreasing order.)