Due 12 December 2005
Much easier than the SCHEME problems.  In prolog do the following small problmes

Define a rule for Fibonacci 

Define a rule for the RDC algorithm from SCHEME (remove last element of the list)


Longer problem:

We'd like to find out who is graduating (I'm making it simple).  Define a rule which models graudation.

A student can only graduate if he has taken the required courses
Every student Must take CS1114 and CS1124
A student can take either CS2134 or CE394
After that a student must take two electives.

Electives are:
CS991
CS992
CS993
CE494
CE495