a 2. For the question, first construct a flow network G using your student id as follows (*14600015' will be used here as an example to show you how the graph is constructed. Note that if your id contains letters, first remove the letters, then apply the following steps. For instance, if your id is '18YZ0345', consider it as '180345'): multiply your id with 123456789' 14600015 * 123456789 = 1802470971251835 remove all the zeros 1802470971251835 18247971251835 . cut out the first 9 numbers 182479712 ) > assign the numbers to the associated edges as capacity (s, a) 1,(s,c) 8, (c, a) 2,(c,b) 4, (c,d) + 7, ( (a,b) 9,(b, d) 7,(b,t) 1,(d, t) + 2 construct the corresponding flow network ) ) 9 1 4 2 7 + 8 2 7 Assume you are using the Ford-Fulkerson algorithm to find the maximum flow, and you have applied the augmenting paths (s c-d-t) and (s c-b t) for the first two steps. a) (20p) Draw the residual network formed after these two augmenting paths. b) (16p) List all the augmenting paths that could be chosen as the third augmenting path (if there is any) together with the residual capacity of each path