****PLEASEKINDLY ENSURE TO REPLY WITH JAVA CODE AS WELL AS SCREENSHOTS OF OUTPUT FROM ECLIPSE********

Use standard data structure classes from the Oracle Java API;

(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++;

}