4 . mm 100 dan 4-) (30 pts) Write a function change int heap[], int mint value) that receives a minimum heap as array and integers k and value to change the item at index m by value. Note that the heap may require to maintain heap order property. The number of elements in the heap is n. Dizi ile implemente edilmi bir minimum heap ve m, value tamsay deerleri alan changeint heap[ int mint value) fonksiyonu yaznz. Bu fonksiyon m indisindeki deeri value ile deitiriyor. Heap order zelliinin salanp salanmadna dikkat edin. Heap deki eleman says n dir. 1 A- B1 %