Need help right now please

Question 6 1.5 pts public static int f5(int x, int y) { int z = 0; for (int i = x; i > @; i /= 2) { if (i % 2 == 1) { z += y; } y *= 2; } return z; } O 0(1) Odlog N) O(N) O O(N log N) O O(N) Question 7 1.5 pts public static int f6(int x, int y) { int q = ; y = y = y) { q++; X -= y; } } return g; } O 0(1) O O(log N) O O(N) O O(N log N) O O(N) > Question 8 public static int f7(int x, int y) { int z = 0; while (x >= y) { Z++; X -= y; } return x; } O 0(1) O(log N) O(N) O O(N log N) O O(N)