100 points: The Mark-and-Compact algorithm has somewhat intensive running time because it traverses the entire heap in the Compact step. Moving data during the Mark step (the Copy algorithm does this) would speed things up. Why doesn't this approach work?