you give array b consist n positive great zero integer you give integer kIn choose index j 1 le j le n swap a_i b_j ie a_i b_j vice versa Note j equal different particular swap a_2 b_2 swap a_3 b_9 acceptable movesYour task find maximum possible sum obtain array ie k move swapsyou answer t independent test case