COSC3308 Program-8 (Prolog-1) Due: 12/4/2006
Task: Write a Prolog program with an internal goal that will find all ancestors (of somebody) and write
each pair of ancestor-decendant, using the following 10 facts:
(using predicate: ancestor(A,B)), among others:

parent(kim,susan)
parent(kim,donna)
parent(donna,diane)
parent(diane,george)
parent(george,jimmy)
parent(jimmy,david)
parent(david,steven)
parent(steven,apple)
parent(jimmy,mike)
parent(jimmy,john)
By definition, a parent is an ancestor and any parent's ancestor is an ancestor.
Given above facts listed in the given order, the outputs should be in the following order:
kim is an ancestor of susan
kim is an ancestor of donna
donna is ancestor of diane
diane is ancestor of george
george is ancestor of jimmy
jimmy is ancestor of david
david is ancestor of steven
steven is ancestor of apple
jimmy is ancestor of mike
jimmy is ancestor of john
kim is ancestor of diane
kim is ancestor of george
kim is ancestor of jimmy
kim is ancestor of david
kim is ancestor of mike
kim is ancestor of john
kim is ancestor of steven
kim is ancestor of apple
donna is ancestor of george
donna is ancestor of jimmy
...
jimmy is ancestor of steven
jimmy is ancestor of apple (second from the last)
david is ancestor of apple (Last output)
You may find the Prolog-example-5 on this web-page to be useful in creating an output file.