Question: 
Write a python function to find the highest power of 2 that is less than or equal to n.


Model's Code:
def highest_Power_of_2(n):
    power = 1
    while power <= n:
        power *= 2
    return power // 2



Sample Correct Code:
def highest_Power_of_2(n): 
    res = 0; 
    for i in range(n, 0, -1): 
        if ((i & (i - 1)) == 0): 
            res = i; 
            break; 
    return res; 


Asserts:
assert highest_Power_of_2(10) == 8
assert highest_Power_of_2(19) == 16
assert highest_Power_of_2(32) == 32


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 388 of 974: 280/388 (72.16494845360825%): success