Find the number of instructions and the time complexity for the following code snippets:

q1:

sum = 0; for(int i=0; i

q2:

sum = 0; for(int i=0; i

q3:

sum = 0;prod=1;

for(int i=1; i<=n; i*=3){

prod*=A[i];

for(int j=0;j<=n;j++){

sum+=1;

}

}