1. (5 marks) What is the time complexity in Big-O for the following two Java code snippets? a): Snippet one:

int i = 1;

while(i <= n){

System.out.println("i = : " + i);

i *= 3;

}

b): Snippet two:

int i = 1, j = 1;

while(i <= n){

while(j <= n){

System.out.println("i: " + i + " and j: " + j);

j *= 4;

}

i++;

}