$8\mathrm{.}6$ Break this program into basic blocks.

mlarr$0$

vlarr$0$

if $vn$ goto $15$

rlarrv

slarr$0$

if vlarrv$+1$xlarrM$[r]slarrs+xs$mmlarrsrlarrr$+1mr$ goto $9$

vlarrv$+1$

goto $3$

xlarrM$[r]$

slarrs$+x$

$ifsm$ goto $13$

mlarrs

rlarrr$+1$

goto $6$

return $m$

$8\mathrm{.}7$ Express the basic blocks $of$ Exercise $8\mathrm{.}6as$ statements $in$ the Tree intermediate form, and use Algorithm $8\mathrm{.}2to$ generate a set $of$ traces.