Do a detailed trace of the execution of the Mark algorithm on this memory graph. Included every attempt to mark a block so that it is clear that the algorithm considers every outgoing link when a block is marked and that it chooses not to visit previously marked blocks. Indicate on the diagram which blocks will be collected by the Sweep phase of garbage collection. 7 p 2 5 s 3 Do a detailed trace of the execution of the Mark algorithm on this memory graph. Included every attempt to mark a block so that it is clear that the algorithm considers every outgoing link when a block is marked and that it chooses not to visit previously marked blocks. Indicate on the diagram which blocks will be collected by the Sweep phase of garbage collection. 7 p 2 5 s 3