)recall the problem of finding the number of inversions. as in the text, we are given a sequence of n numbers a1, a2, . . , an, which we assume are all distinct, and we define an inversion to be a pair i < j such that ai > aj . we motivate the problem of counting inversions as a good measure of how different two orderings are. however, one might feel that this measure is too sensitive. let call a pair a significant inversion if i < j and ai > 2aj . give an o(n log n) algorithm to count the number of significant inversions between two orderings.

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