you give sorted integer array arr contain 1 prime number integer arr unique you give integer kFor j 0 j arrlength consider fraction arri arrjReturn kth small fraction consider return answer array integer size 2 answer0 arri answer1 arrj Example 1Input arr 1235 k 3output 25explanation the fraction consider sorted order are15 13 25 12 35 23the fraction 25example 2input arr 17 k 1output 17 Constraints2 arrlength 10001 arri 3 104arr0 1arri prime number 0all number arr unique sort strictly increase order1 k arrlength arrlength 1 2 Follow can solve problem well on2 complexity