(a) How many different Hamilton circuits are there in Kn, a complete graph onn vertices?

(b) Show that Kn, n prime 3, can have its edges partitioned into (1/2)(n 1)disjoint Hamilton circuits.

(c) If 17 professors dine together at a circular table during a conference, andif each night each professor sits next to a pair of different professors, howmany days can the conference last?