Divide and Conquer Algorithm

3. Consider a scheduling problem where n sports teams seek to book a party at a pub. Team i would like to party from time s, to time f. Also teami has Q members. If team i and team j have party intervals that overlap and for some reason both teams show up at the pub then there will be a rumble of magnitude Q.Q. Assume that the pub scheduler has at least managed to ensure that three or more teams don't show up at once. Provide an efficient divide-and-conquer algorithm for computing the largest pos- sible rumble that could occur because two teams with conflicting party intervals both show up. You are given si, fi and Qi for 1 n. Provide a divide-and- conquer recurrence for the running time of your algorithm. 3. Consider a scheduling problem where n sports teams seek to book a party at a pub. Team i would like to party from time s, to time f. Also teami has Q members. If team i and team j have party intervals that overlap and for some reason both teams show up at the pub then there will be a rumble of magnitude Q.Q. Assume that the pub scheduler has at least managed to ensure that three or more teams don't show up at once. Provide an efficient divide-and-conquer algorithm for computing the largest pos- sible rumble that could occur because two teams with conflicting party intervals both show up. You are given si, fi and Qi for 1 n. Provide a divide-and- conquer recurrence for the running time of your algorithm