(10 pts) It is awards banquet time at Watchburg University. All administrators are to be seated at a round table. For every pair of administrators it is known whether they have a history of conflict and should thus not be seated next to each other. Bryan has been tasked to determine whether it is possible to seat the n administrators around an n-chair round table so that no pair of administrators seated next to each other have a history of conflict. Recalling your 381 experience, you realize that determining whether such a seating arrangement exists is an NP-complete problem. Prove that the seating problem is indeed NP-complete in order to convince Bryan.