We have a weakly connected loopless directed graph D with Vv V(D) : d+(v) = 1 and n = |V(D)|2. Answer the following in terms of n, prove or otherwise justify your responses: (a) What are the maximum and minimum number of cycles that D can have in terms of n? hundreds of yen. (b) What is the maximum number of cycles if D isn't weakly connected? (c) What is the maximum number of cycles if D is neither weakly connected nor loopless?