a shopkeeper sells n items where the price of the ith item is price[i]. to maintain balance, the shopkeeper wishes to adjust the price of items such that the median of prices is exactly k. .
In one move, the shopkeeper can increase or decrease the price of any item by 1, and the shopkeeper can perform this move any number of times.Find the minimum number of moves in which the median of prices becomes exactly k.
a. The function is expected to return a LONG_INTEGER
b. the funtion accepts following parameters:
c. Integer_Array price
d. Integer k