please answer the whole question(1 and 2)

1. Every Activity on Node netwotk has an associated adjacency matrix Q, where a "mex-plas" opetation on Q is defined in order to calculate the letisth of the lorgest path in the network (and bence the minimum completion time of the project). Pleass answer the folloning questions rigoroualy. (a) Let QP be the matrix that results by taking the max-phes operation p tiass of Q. What can you cosclude if Q=Q+1 ? (b) Given that Q=Q+1, what does the ratry of Q in the ror of a and the column of 5 repterent? (c) More getictally, siven that Q=Q+1, what do the numbern in the row of a reptexcot? (d) Suppose that you wanted to deoign a matrix mothod for calcalsting the fotest fincoliag times of all activities in an AON network. How-would you specify ab adjacency mintrix and a corteponaling matrix operation it ofder to achiove thin? 2. Consider the network below: (a) Wrice down the adjacency matrix for the gove network aing the formulia Iodec your ross and colutina in the order o, e, bir, d,e,f,t restotines the BFs metbod from clas ramber of abortist paths from a to t