Problem 3 (3 points): An advertising company wants to invest $10K on advertizing its product in a particular community that consists of 71 people. The company has access to data that determine who is friends with who in the community; that is, it has access to an n x n matrix A with element {aij = 1} if and only if person i is friends with person j (clearly (1,4 = 1). The company plans to spend a certain amount of money for advertising on each person. It wants to distribute the money, so that, the worst case difference between the money a person gets and the money any one of its friends gets, is as small as possible. Moreover, it wants to make sure that for each person, the sum of the money all the friends of a person get, is at least 01 and at most 02. Formulate this problem as an LP