96. Determine the minimum number of time slots to schedule the seven committees represented by vertices in the accompanying graph, if edges show which committees cannot meet at the same time.