The forest ____ refers to the Active Directory functions supported forest-wide.

I have an algorithm that runs in O(N 1/2 ), where n is the size of the problem. For N = 100, the time the algorithm runs is 1 minute. How long does the algorithm take for N=1000?

a) Same time b) About 3 minutes c) About 10 minutes d) About 30 minutes e) You haven’t given enough information. I can’t tell.

What is the output of the following code?

``` public class Test { public static void main(String[] args) { int[][] matrix = {{1, 2, 3, 4}, {4, 5, 6, 7}, {8, 9, 10, 11}, {12, 13, 14, 15}}; for (int i = 0; i < 4; i++) System.out.print(matrix[i][1] + " "); } }``` a. 1 2 3 4 b. 4 5 6 7 c. 1 3 8 12 d. 2 5 9 13 e. 3 6 10 14