Based on the insertion sort code traced in the demo for a linked chain.  Given a linked chain containing 8 -> 4 -> 32 -> 16 -> 256 -> 64 -> 128, what is the state of the sorted and unsorted linked chains at the end of the fifth time through the while loop in insertionSort?

4 -> 8 -> 16 -> 32 -> 64 -> 256, 128
  • 4 -> 8 -> 16 -> 32 -> 64 -> 128 -> 256
  • 4 -> 8 -> 16 -> 32 -> 256, 64 -> 128
  • 4 -> 8 -> 32, 16 -> 256 -> 64 -> 128
  • 4 -> 8 -> 16 -> 64 -> 256 -> 32 -> 128

There are no hints for this question