Question one [25 marks] Finding a missing number An array of n elements contains all but one of the integers from 1 to n+1 1. Give the best algorithm yo u can for determining which number is missing if the array is sorted, and analyze its asymptotic worst-case running time. 2. Give the best algorithm you can for determining which number is missing if the array is not sorted, and analyze its asymptotic worst-case running time. 23 648(o