A schedule is an ordering of the jobs for the supercomputer, and the completion time of the schedule is the earliest time at which all jobs are finished processing on PCs. This is an important quantity to minimize, since it determines how rapidly El Goog can generate a new index. Give a polynomial time algorithm (as fast as possible) that finds a schedule which is as small as possible.

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