The first step in the naïve greedy algorithm is?

• A. analysing the zero flow
• B. calculating the maximum flow using trial and error
• C. adding flows with higher values
• D. reversing flow if required