Suppose we are given a sequence of medical tests, conducted after giving a medicine and representing infection values v1, v2 . . . vn. To evaluate the effectiveness of the medicine, the doctor wants to detect a falling trend. A trend is a subsequence of values at time instances i1 < i2 < ... < ik. Devise an algorithm to find the longest positive falling trend, i. e. the longest sequence of values vi1 vi2 . . . vij such thatvir ≥vir+1 +1andir

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