# (Solved) : Planning Seating Arrangement Alumni Meet Given List People P Suppose Also Given Lookup Ta Q38814471 . . .

$9.00

a. You are planning the seating arrangement for an alumni meet,given a list of people, P. Suppose you are also given a lookuptable L, where L[u] for u ∈ P, is a list of guests that u is afriend of. If u is a friend of v, then v is a friend of u. You arerequired, to arrange the seating such that, any guest at a table isa friend of every other guest sitting at the same table eitherdirectly or through some other guests sitting at the same table.For example, if u is a friend of v, and v is a friend of w, then u,v, w can sit at the same table. i. Describe an efficient algorithmthat, given P and L, returns the minimum number of tables needed toachieve this requirement. ii. Give the running time of youralgorithm.

## Expert Answer

Answer to a. You are planning the seating arrangement for an alumni meet, given a list of people, P. Suppose you are also given a …

## Description

a. You are planning the seating arrangement for an alumni meet,given a list of people, P. Suppose you are also given a lookuptable L, where L[u] for u ∈ P, is a list of guests that u is afriend of. If u is a friend of v, then v is a friend of u. You arerequired, to arrange the seating such that, any guest at a table isa friend of every other guest sitting at the same table eitherdirectly or through some other guests sitting at the same table.For example, if u is a friend of v, ... View full description