Right Insertion Point

Write a function `right_insertion(a, x)` that determines the index at which a specified value `x` should be inserted into a sorted list `a` to maintain the sorted order. If `x` is already present in the list, the function should return the index after the last occurrence of `x`.

#### Example Usage
```python [main.nopy]
right_insertion([1, 2, 4, 5], 6)  # Output: 4
right_insertion([1, 2, 4, 5], 3)  # Output: 2
right_insertion([1, 2, 4, 5], 7)  # Output: 4
```

#### Constraints
- The input list `a` is guaranteed to be sorted in ascending order.
- The function should have a time complexity of O(log n).
- You may use Python's built-in libraries to assist in solving the problem.

import bisect

def right_insertion(a, x):
    """
    Determine the right insertion point for x in the sorted list a.

    Args:
        a (list): A sorted list of elements.
        x (any): The value to find the insertion point for.

    Returns:
        int: The index where x should be inserted to maintain sorted order.
    """
    # Use the bisect module to find the right insertion point
    pass

Press Shift+Enter or click Run to execute.

Intermediate lists

More challenges to try

Check Equal Tuple Lengths Median of Two Sorted Lists Filter Negative Numbers Swap First and Last Elements Split List into Two Parts Sum Even Numbers at Even Positions Check Even Indices for Even Numbers Count Identical Items in Three Lists Count XOR Even Pairs Zero to Non-Zero Ratio