Given this code, write the assembly code for this in Microsoft x$86-64$ Windows. Given that data contains heap$\_$count: $.$long $0```$

RECORD $*$heap$\_$remove$()$;

$/*$

This function removes the smallest value in the heap, i$.$e$.$

the value at the root node $($at array index $0),$ and returns

that smallest value $($which is a pointer to a record$).$

Before returning, it writes the value of the last

leaf $($at index heap$\_$count$-1$ of the array$)$ into to the

root node and then calls sift$\_$down$(),$ above, to

restore the heap property.

$*/$

$/*$

RECORD $*$heap$\_$remove$()$

$\{$

if $($heap$\_$count

printf$("$Error: Heap is empty

$")$;

exit$(1)$;

$\}$

RECORD $*$result $=$ heap$[0]$;

heap$\_$count$--$;

heap$[0]=$ heap$[$heap$\_$count$]$;

sift$\_$down$()$;

return result;

$\}$

$**$

$```.$data

$```$

$.$globl heap$\_$count

heap$\_$count:

$.$long $0$ # Initialize heap$\_$count to

error$\_$msg:

$.$asciz "Error: Heap is empty"

$```$