Select all the statements below which are TRUE: Consider the flow network below. The value of the flow |f| is 20. 8/10 5/5 3 3 3/3 5/10 s 8/8 8/8 t a a b 3/3 3 5/5 8/10 d Consider the Divide-and-Conquer algorithm that we have discussed in class for the closest Pair of Points problem. The Divide step takes linear time (i.e. O(n) time). The running time for adding two matrices of size n x nis (n). Let G(V.E) be a flow network with flow f. Take two cuts (S,T) and (S.T'). Then If