You are given an array that holds the weights of n people in the class w = (w1, w2, wn). your goal is to divide the n people into two teams such that the total weight of the two teams is equal or as close as possible to equal. describe such an algorithm and give its running time. the total number of people on each team should differ by at most 1. assume that m is the maximum weight of a person, i. f., ∀i'm. the running time should be a polynomial function of n and m. the output should be the list of people on each team and the difference in weight.