3.8 Describe and draw an efficient mapping of the task-dependency graph of the decomposition shown in Figure 3.27 onto four processes and prove that your mapping is the best possible mapping for four processes Figure 3.27. A decomposition of LU factorization into 14 tasks. A1,1A2,1A3,1A1,2A2.2A3.2A1,3A2.3A3.3L1,1L2.1L3,10L2.2L3.200L3.3U1,100U1,2U2,20U1,3U2.3U3,3I:A1.1L1,1U1,12:L2.1=A2,1U1.113:L3.1=A3,1U1,116:A2.2=A2.2L2.1U1,27:A3.2=A3,2L3,1U1,28:A2.3=A2.3L2.1U1.311:L3.2=A3,2U2.2112:U2.3=L2.21A2.313:A3.3=A3.3L3,2U2.3