Consider the circuit-switched network in the figure on the right. Recall that there are 10 circuits on each link. Label the four switches A, B, C and D, going in the clockwise direction. a. What is the maximum number of simultaneous connections that can be in progress at any one time in this network? b. Suppose that all connections are between switches A and C. What is the maximum number of simultaneous connections that can be in progress? c. Suppose we want to make ten connections between switches A and C, and another ten connections between switches B and D. Can we route these calls through the links shown in the figure on the right to accommodate all twenty connections? (To get any credit, you MUST explain how and illustrate it via a graph if the answer is "yes".) (hints for (a): You may want to maximize the connections by assuming that each connection is only required to be between two adjacent switches, for example, between A and B or B and C or C and D or D and A)