You are organizing a dinner and have to assign seats tonguests around a round ta-ble withNplaces. For every pair of guests there is a positive valueDislike(i, j) thatmeasures how much guestidislikes sitting next to guestj. For simplicity assume thatDislike(i, j) =Dislike(j, i). Your objective is to find the seat assignment that minimizesthe total displeasure of your guests.1. Formulate the problem as a search problem by defining the state space using anincremental formulation. Specify how you would represent the states, then specifythe initial state, the goal condition, and the actions.2. Repeat the previous part but this time using a complete state space formulation.3. Describe what are the advantages/disadvantages of the two choices for the represen-atation.