Question 5 10 pts Select all the statements below which are TRUE Let G(V,E) be a flow network with flow f. Take two cuts (S,T) and (S',T). Then the expression c (S, T) c (S, , ') is always true. The 3 - Independent Set problem is tractable. O Let T be a B-tree with t 3. Then T.root.n is an integer number between 1 and 5. OLet G(V.E) be a flow network with flow f, and let Gf (V, Ef) be the corresponding residual network. Then Efl2E The running time for adding two matrices of size n x n is 0 (n3) O in the Strassen's algorithm, the Divide step takes (1) Question 5 10 pts Select all the statements below which are TRUE Let G(V,E) be a flow network with flow f. Take two cuts (S,T) and (S',T). Then the expression c (S, T) c (S, , ') is always true. The 3 - Independent Set problem is tractable. O Let T be a B-tree with t 3. Then T.root.n is an integer number between 1 and 5. OLet G(V.E) be a flow network with flow f, and let Gf (V, Ef) be the corresponding residual network. Then Efl2E The running time for adding two matrices of size n x n is 0 (n3) O in the Strassen's algorithm, the Divide step takes (1)