8. A school is creating class schedules for its students. The students submit their requested courses and then a program will be designed to find the optimal schedule for all students The school has determined that finding the absolute best schedule cannot be solved in a reasonable time. Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time. which principle does this decision best demonstrate? 0000 A Unreasonable algorithms may sometimes also be undecidable B. Heuristics can be used to solve some problems for which no reasonable algorithm casts C. Two algorithms that solve the same problem must also have the same efficiency 0. Approximate solutions are often identical to optimal solutions 2. Which of the following algorithmic efficiencies would be considered LEAST efficient? A Linear B. Constant OC. Polynomial D. Exponential 10. Which of the following best describes the existence of undecidable problems? A Undecidable problems are problems for which more than one algorithm solves the problem and computer scientists have not yet chosen the gorithm they believe is best Os. Undecidable problems are problems for which an algorithm can be written that will produce the same output for at least two possible inputs O c. Undecidable problems are problems for which an algorithm can be written that produces a correct output for all inputs but in an unreasonable time O D. An undecidable problem is a problem for which no algorithm can be constructed that always produces a correct output