Question: 
Write a function to locate the right insertion point for a specified value in sorted order.


Model's Code:
def right_insertion(lst, value):
    for i in range(len(lst)):
        if lst[i] >= value:
            return i
    return len(lst)



Sample Correct Code:
import bisect
def right_insertion(a, x):
    i = bisect.bisect_right(a, x)
    return i


Asserts:
assert right_insertion([1,2,4,5],6)==4
assert right_insertion([1,2,4,5],3)==2
assert right_insertion([1,2,4,5],7)==4


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

Test 786 of 974: 595/786 (75.69974554707379%): success