Write a program to read data starting at the label data: $($the end of the data will be indicated by $0$x$00.),$ generate a sorted linked$-$list using the new: and insert: procedures described above, then flatten: the sorted list back into memory starting at the label data:.

You may assume the existence of procedures new:, insert:, and flatten: as described previously. Since you don't know the implementation details of these procedures, you'd better save any register values you care about!

main:

$//$your code goes here

mov x$8,93$

svc $0$

here are the existing procedures:

insert:

cbz x$1,$ new$\_$head

ldr x$2,[$x$0]$

mov x$3,$ x$1$

mov x$4,0$

loop:

ldr x$5,[$x$3]$

cmp x$2,$ x$5$

b$.$le earlier$\_$val

mov x$4,$ x$3$

ldr x$3,[$x$3,8]$

cbz x$3,$ end

b loop

new$\_$head:

str x$1,[$x$0,8]$

mov x$7,$ x$0$

ret

earlier$\_$val:

str x$3,[$x$0,8]$

cbz x$4,$ set$\_$head

str x$0,[$x$4,8]$

mov x$7,$ x$1$

ret

end:

str x$0,[$x$4,8]$

str xzr$,[$x$0,8]$

mov x$7,$ x$1$

ret

set$\_$head:

mov x$7,$ x$0$

retnew:

mov x$1,$ x$0$

mov x$8,0$xD$6$

mov x$0,0$

svc $0$

mov x$2,$ x$0$

add x$0,$ x$2,16$

mov x$8,0$xD$6$

svc $0$

str x$1,[$x$2]$

mov x$3,0$x$0$

str x$3,[$x$2,8]$

mov x$7,$ x$2$

ret