The first code snippet has a time complexity of O(log n) due to the loop doubling 'i' with each iteration. The second snippet has a time complexity of O(n log n) because the outer loop runs 'n' times while the inner loop also runs logarithmically with respect to 'j'. Both snippets output values to the console based on their respective loops.

1. 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 *= 2; }
b): Snippet two: int i = 1, j = 1; while(i <= n){ while(j <= n){ System.out.println("i: " + i + " and
j: " + j); j *= 2; } i++; }