a) Explain how to implement a welfare-maximizing DSIC mechanism by invoking this subroutine n + 1 times, where n is the number of participants.
(b) Conclude that mechanisms that are ideal in the sense of Theorem 2.4 exist for precisely the families of single-parameter environments in which the welfare-maximization problem (given bas input, compute (4.2)) can be solved in polynomial time.
