plz solve All parts as soon as possible

2. Consider the digraph G=(N,A) and b depicted below: https://peoplemath.carleton.ca/-kcheung/math/problems/MATH3802/W23/04/a04.html 1/2 2/5/23,2:35PM MATH 3802 A (Winter 2023) Let T={e3,e4,e5,e7,e8}. a. (1 point) Give the tree solution determined by the tree with arc-set T. b. (2 points) Construct the set S(T) of nodes joined by a path (not necessarily directed) to v6 using only arcs in T that are not bad and conclude that the network is decomposable. 3. Consider the digraph G=(N,A) and b depicted below: a. (1 point) Let T={e1,e2,e3,e4,e6,e7}. Show that the tree with arc-set T is a strongly feasible tree (with v7 as the root) determining a feasible tree solution. b. (1 point) Suppose that the tree solution in the previous part is encountered in an iteration of the Network Simplex Method. If e5 is chosen as the entering arc, what would be chosen as the leaving arc if Cunningham's anticycling rule is used