Consider the following directed network. (a) Find a directed path from node A to node F and then identify (b) Find three directed cycles. Then identify an undirected cycle (c) Identify a set of arcs that forms a spanning tree three other undirected paths from node A to node F that includes every node. (d) Use the process illustrated in Fig. 10.3 to grow a tree one arc at a time until a spanning tree has been formed. Then repeat this process to obtain another spanning tree. [Do not duplicate the spanning tree identified in part (c)