2 points Q1. Arrange the following ID numbers in descending order. Highlight the elements that get swapped in each step when the data is sorted using selection sort * 1181100492 1181100581 1171203694 1171101010 1181103248 1171302253 1151100202 1181103516 1191100919 1191302077 1181101066 Add File Q2. Search your own ID number from the sorted ID numbers in Question 1 2 points using binary search. Highlight the elements involved in each step during the search. Mark the middle element. * 1 Add File 1 point Q3. Is binary search a suitable searching algorithm to search for an ID number for the given set of ID numbers in Question 1? Why or why not? * Your