1. Analyze the following codes and indicate if there is a data dependency. For each data dependency it indicates what type it is, the distance and from where to where it goes. Finally, once the data dependencies have been analyzed, it indicates which codes are vectorizable and writes the vector code. N is a constant that can have any value. TO) char a, b, i; for (i-16; i =3; i--) a[i] = a[i+2] +a[1-3]; **** int *a, *b, i; for(i=1;i < (N-1); i++) a[i] = a[i-1]+ b[i];