In our analysis of the select algorithm for a block size of 5, we compared the median of the medians with every other element in the input array to partition it. However, that led to more comparisons than we should have done. We could reduce it since we know that at least 3n/10 elements are less than or equal to the median of the medians and similar number of elements is at least greater than or equal to the median of the medians. Obtain a new upper bound on the worst-case number of comparisons using this piece of information. What is the value of the constant?

Multiple choice project create a program with two multiple choice questions. 1. users have two attempts only, show attempt number each time. hint: while loop with break control. (20%) 2. only one correct answer for each question, use switch case for each question. (20%) 3. show total score after the two questions are answered. hint: . (20%) 4. user have options to answer the two questions again if first attempt score is not 100%. hint: if statment. (20%) 5. use string method .toupper() to allow users to enter with lowercase or uppercase letters. (20%) 1. where is the capital of the state of florida? a. orlando b. tallahassee c. miami d. tampa b 2. where is walt disney world park located in florida? a. orlando b. tallahassee c. miami d. tampa a