4. It is useful to look at an example of a social planner's problem with more than one agent. Suppose there are two types of agents, 1 and 2. The Planner's problem is max aU(c1,l1) + [1 a)U(c2.t2) {CIJCZJ} subject to c1 + C2 + G = Afl. 12] where a: is the relative weight the planner puts on agent 1 relative to agent 2. Assuming that U is separable in c and I, obtain the optimality conditions to conrm that the agent with the higher weight nets to consume more