For the following two problems, run the algorithms manually (without the aid of programs or tools).

(a) If you sort the array 8, 3, 5, 4, 7 using insertion sort, how many times do you swap two elements?

(b) If you sort the array 8, 3, 5, 4, 7 using selection sort, is the number of times you swap two elements greater, less than, or equal to the number of swaps you came up with for insertion sort?