A shopkeeper sells n items where the price of theith item is price$[$i$].$ To maintain balance, theshopkeeper wishes to adjust the price of itemssuch that the mediag of prices is exactly k$.$ In onemove, the shopkeeper can increase or decrease theprice of any item by $1,$ and the shopkeeper canperform this move any number of timesV$2$C$2627282930313233$Find the minimum number of moves in which themedian of prices becomes exactly kNote: The index of the median of an array ofm sorted elements, where m$.$is odd, is $($m$=1)/2.$ Forexample, $[2,5,4,1,1,1,6]$ sorted is $[1,1,1,2,4,561.$ lts length is $7$ so the median is at index $(7+1)/24$ using $1-$based indexing. The median is $2.$ExampleConsider n $=5,$ price $=[4,2,1,4,71$and k$=3.$Decrease price$[0]$ by $1,$ the resulting array is $[3,2,1,4,7],$ on sorting, this becomes $/1,2,3,477,$ whosemedian equals k $-3,$ Thus, in one move, themedian becomes $3$ and the answer is $1.$