Consider the following list. list = {24, 20, 10, 75, 70, 18, 60, 35} suppose that list is sorted using the insertion sort algorithm as discussed in the book. what is the resulting list after two passes of the sorting phase; that is, after three iterations of the for loop? a. list = {10, 18, 20, 24, 75, 70, 60, 35}b. list = {10, 20, 24, 75, 70, 18, 60, 35}c. list = {10, 18, 20, 24, 35, 70, 60, 75}d. list = {10, 20, 20, 18, 35, 70, 60, 75}