Answer:
Check the explanation
Step-by-step explanation:
========================================================================
// Part 3 (a)
public static int largestPow2LessThan(int n) {
int two = 1;
while (two * 2 < n) {
two *= 2;
}
return two;
}
================================================================