Use the network below where bar A is the source and bar F is terminal to answer the following questions.

a$)(4$ points$)$ Look at the number marked next to the directional link as a distance and make a shortest path from A to F

Get it$.$

b$)(8$ points$)$ View the number indicated next to the directional link in terms of the link capacity and add a flow path

Use the algorithm to find the maximum flow from A to F and the flow by link at that time.

c$)(4$ points$)$ Find the minimum cut using the data in question b$)$ and find the capacity

Compare with the maximum flow obtained.

d$)(4$ points$)$ Ignoring the direction shown on the link, see the number next to the link as a distance and Min Spanning

Get a tree.

I$\text{'}$m a beginner. I don't know any of this. Please solve it and explain it in detail.