Question: 
Write a python function to find the maximum occuring divisor in an interval.


Model's Code:
def find_Divisor(start, end):
    from collections import Counter
    divisor_count = Counter()
    
    for number in range(start, end + 1):
        for divisor in range(1, number + 1):
            if number % divisor == 0:
                divisor_count[divisor] += 1
    
    return max(divisor_count, key=divisor_count.get)



Sample Correct Code:
def find_Divisor(x,y):  
    if (x==y): 
        return y 
    return 2


Asserts:
assert find_Divisor(2,2) == 2
assert find_Divisor(2,5) == 2
assert find_Divisor(5,10) == 2


Tests:
Test 1 of 3: FAIL: AssertionError()

Test 339 of 974: 245/339 (72.27138643067846%): failed