In Figure $6-20$ of the textbook $($page $539),$ suppose that a new flow E is added that takes a path from R$1$ to R$2$ to R$6($see red lines below$).$ How does the max$-$min

bandwidth allocation change for the five flows?