(a) what is the worst case, average case, and best case running time of insertion into slot a[0] of an (unsorted) array a containing n integers, representing a stack? give θ bounds and explain your answer. (b) what is the amortized running time of insertion of n integers into an initially empty array a, representing a stack, if every insertion takes place at a[0]? give a tight o bound and explain your answer.

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