In the context of the maximum flow problem in a network graph, what does the Ford-Fulkerson algorithm typically use to find the maximum flow?Select one:a. It finds the longest path from the source to the sink and determines the flow based on this path.b. It calculates the minimum capacity of all edges in the network and uses that as the maximum flow.c. It divides the graph into equal halves and calculates the flow for each half separately.d. It uses augmenting paths to increase the flow until no more augmenting paths are found.

Time complexity of Ford fulkerson Algorithm is2 pointsO (E * |f|) , where f is the maximum flow and E is no of edges in network.O (E + |f|) , where f is the maximum flow and E is no of edges in network.O (E / |f|) , where f is the maximum flow and E is no of edges in network.O (E - |f|) , where f is the maximum flow and E is no of edges in network.

Time complexity of Ford fulkerson Algorithm is

The maximal flow solution algorithm allows the user to choose a path through the network from the origin to the destination by any criteria.

A traffic system could be represented as a network in order to determine bottlenecks using the maximal flow network algorithm.

A traffic system could be represented as a network in order to determine bottlenecks using the maximal flow network algorithm. *TrueFalse