Sort the list [ 13, 4, 10, 75, 20, 25] using Insertion Sort. You do not need to write the algorithm. Just draw the content of the list every time an element changes position until it's finally sorted.

A binary search on a list assumes that the items in the list are sorted. TRUE OR FALSE?