please provide me the complete solution and make sure to add this code to the code that you will provid to me LDR R$0,=$arr ; address of array

LDR R$1,[$R$0],$ #$4$ ; array size arr$[0],$ r$0+4=>$ arr$[1]->$ it is actual array address

MOV R$2,$ #$0$ ; i $->$ index of node

MOV R$10,$ R$0$ ; store array address, because sort procedure change the address and size

MOV R$11,$ R$1$ ; store array size, because sort procedure change the address and size

BL sort ; call sort procedure

; restore to the original registers

MOV R$0,$ R$10$

MOV R$1,$ R$11$

MOV R$4,$ #$3$

BL find ; check whether $3$ in min heap

MOV R$4,$ #$12$

BL find ; check whether $12$ in min heap

dead ; then go to the dead loop and finish

B dead

arr

DCD $5,4,6,3,2,9$; arr$[0]->$ size, arr $=[1...$size$]$

END