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?

A. Unreasonable algorithms may sometimes also be undecidable
B. Heuristics can be used to solve some problems for which no reasonable algorithm exists
C. Two algorithms that solve the same problem must also have the same efficiency
D. Approximate solutions are often identical to optimal solutions