Find an admissible non-trivial heuristic (i.e. not h(n) = 0, or something similarly trivial) for the problems below. For all of the problems, assume you are using an incremental problem description.

You need to take 40 more credits to finish your major (each class is 4 credits). You cannot take two classes that have lectures at the same time. Some some classes are not offered every semester and some classes have prerequisite classes that you must take first. Describe what heuristic you can use to find a schedule that lets you graduate as fast as possible (fewest number of semesters) without taking more than 16 credits per semester.