Answer from cs61c-eo (James McBryan 16730959) for Question 4
This will not be reclamied by the reference count because in this algorithm, the pointers all have a count of how many objects point to them.  Something is always pointing to something so it will never be removed.


If the above structure is not attached to the root at all, DFS won't be able to get it and will not be marked.  It will stay there unless a marking is used to mark all the used memory and get rid of everything else.