Suppose that we have a group of N people standing in a line. Consider the problem of checking whether the people are ordered from youngest to oldest. For this problem, the people may not move or ask one another for their age. You, however, may ask each person for their age, and they will answer honestly. [15 pts.] Question 1a Briefly describe an algorithm for solving the above problem (i.e., checking if the people are sorted by age) [25 pts.] Question 1b Provide a complexity analysis of your algorithm from (1a). First, perform an exact analysis: state the best and worst case number of operations performed by the algorithm (in terms of the list size, N). Then, give the orders of magnitude for the best and worst case (again, in terms of the list size, N) along with an explanation justifying your analysis. In your answer, you should state what you consider to be one "operation. Here are two reasonable choices: 1. Asking a person for their age 2. Comparing the ages of two people You may choose to count either or both of these as operations, but be sure to state your choice in your answer to this