There are n poor college students who are renting two houses. For every pair of people p, and Pj, the function d(p pj) outputs an integer between 1 and n2 that indicates the amount of drama that will ensue if both students are placed in the same house. The total drama is maxij d(Pi pj) over all pairs of students in the same house. That is, drama is not cumulative: it is determined by the worst pair of people Given an integer k as input, design an O (n2) algorithm to determine how you can partition the students such that the total drama