Problem $4$: Garbage Collection

Consider the heap state as shown below before garbage collection:

$(4$ pts$)$ For the Mark$-$and$-$Compact algorithm, what objects remain on the heap after

collection? and what will be the new position of the objects in the heap?

$(6$ pts$)$ Consider algorithms Stop$-$and$-$Copy, and assume that:

$($a$)$ Reachability analysis uses depth$-$first search, prioritizing lower addresses, and will

skip objects that have already been visited.

$($b$)$ Search starts from $x,$ and then $y.$

$($c$)$ When the entire heap is traversed, objects are visited from left to right. You don't

need to write down the newly created object copies, if any.

$($d$)$ The root references are retargeted

Write down the objects being visited during the garbage collection in sequence. Explain

at each step how the algorithm is executed. Mark which phases the object is visited

in for all the phases in an algorithm.