Select all answers below that are correct statements about max$-$flow algorithms.

Group of answer choices

Max flow algorithms do not consider cost

Sometimes it takes a long time after the algorithm finds the solution for the algorithm to end.

The all$-$pairs max flow algorithm identifies the flows necessary to achieve the maximums

Max flow algorithms tend to be faster than shortest path algorithms