rotate_right(items, k) that rotates items to the right by k positions and returns the new list. Elements that fall off the end reappear at the front. Handle k larger than len(items). Assume items is non-empty.items = [1, 2, 3, 4, 5], k = 2
[4, 5, 1, 2, 3]
The last two elements move to the front.
k %= len(items) first.
items[-k:] + items[:-k] works, but watch out for k == 0 (special-case it).