Question 5 » The following array of integers are to be sorted into ascending order: 42108612 If selection sort is chosen to sort this array, write the contents of the array each time that the sort...

Extracted text: Question 5 » The following array of integers are to be sorted into ascending order: 42108612 If selection sort is chosen to sort this array, write the contents of the array each time that the sort algorithm changes it. How many comparison operations and how many swaps are performed in the sorting? „It is suspected that out of a set of 64 50p coins one of the coins is fake (i.e., lighter in weight than a genuine coin). With one weighing scale i give a detailed explanation on how you would go about determining the fake coin. What is the minimum number of times you need to use the scales to weigh the coins before identifying the fake coin? ii. b) Write a recursive method that returns the value of N! (N factorial). Explain why you would not normally use recursion to solve this problem.