1. (3.5,6,7) Consider the task decomposition shown in Figure below (this is called Lower and Upper or LU decomposition of a matrix) A1,1A2,1A3,1A1,2A2,2A3,2A1,3A2,3A3,3L1,1L2,1L3,10L2,2L3,200L3,3U1,100U1,2U2,20U1,3U2,3U3,31:A1,1L1,1U1,12:L2,1=A2,1U1,113:L3,1=A3,1U1.114:U1,2=L1.11A1,25:U1,3=L1.11A1,36:A2,2=A2,2L2,1U1,27:A3,2=A3,2L3,1U1,28:A2,3=A2,3L2,1U1.39:A3,3=A3,3L3,1U1,310:A2,2L2,2U2,211:L3,2=A3,2U2,2112:U2,3=L2,21A2,313:A3,3=A3,3L3,2U2,314:A3,3L3,3U3,3 a). We have 14 tasks. Draw a task dependency graph for this decomposition b). Enumerate critical paths in the graph. Assume tasks take the same amount of time. c). Assign the tasks to 3 processors. Try to minimize the execution time