Let $\{$G$=($V$,$E$),$ s$,$ t in V$,$ c$($e$)$ for e in E$\}$ be a network. You are told that c$($e$)$ is a positive integer for all e in E$.$ Select all which are always true:

a $)$ The augmenting path found by DFS will find the shortest path from s to t$.$

b$)$ After every round of Ford$-$Fulkerson, the resulting flow has integer values.

c$)$ The capacity of the augmenting path is the maximum capacity of the edges along the path.