Draw dependence graphs for these two cases and determine all legal transformations
s05_dependence Homework for ( i = 0; i < max;="" i++="" )="" for="" (="" j="0;" j="">< max;="" j++="" )="" for="" (="" k="0;" k="">< max;="" k++="" )="" for="" (="" m="0;" m="">< max; m++) body(i, j, k, m) ; body . a[i, j, k, m] += a[i-1, j, k, m]; r[m] += a[i+1, j-1, k,m]; r[m] += a[i-1, j-1, k+1, m+1]; a[i, j, k, m] += a[i-1, j+1, k, m]; task: draw dependence graph for these two cases, and determine all legal transformations max;="" m++)="" body(i,="" j,="" k,="" m)="" ;="" body="" .="" a[i,="" j,="" k,="" m]="" +="A[i-1," j,="" k,="" m];="" r[m]="" +="A[i+1," j-1,="" k,m];="" r[m]="" +="A[i-1," j-1,="" k+1,="" m+1];="" a[i,="" j,="" k,="" m]="" +="A[i-1," j+1,="" k,="" m];="" task:="" draw="" dependence="" graph="" for="" these="" two="" cases,="" and="" determine="" all="" legal="">