Question 2.5: Bijective Mapping In this function, you will create a mapping between elements in the input list. Specifically, you will create a one-to-one mapping between each element and the element k spaces in front of it. This list should be treated in a circular fashion. For example, given that the input list is [1, 2, 3, 4, 5] and k= 2: 1 maps to 3 3 maps to 5 5 maps to 2 2 maps to 4 4 maps to 1 Notice that when you get to element 5, 2 spaces in front of it is element 2. Notes: It will be useful to think about the input list as a circular list. That is, when you reach the end of the list, wrap around to the beginning. If an element in the list maps to itself, move to the next element. You can assume all elements in the input list are unique. def k_mapping (inp, k): INTERI Maps each element in the circular list to the element k spaces in front of it. >>> k_mapping ([1, 2, 3, 4, 5], 2) '1 -> 3, 3 - 5, 5 -> 2, 2 -> 4, 4 -> 1' >>> k_mapping ([1, 2, 3], 3) '1 -> 1, 2 -> 2, 3 -> 3' I I II Question 2.5: Bijective Mapping In this function, you will create a mapping between elements in the input list. Specifically, you will create a one-to-one mapping between each element and the element k spaces in front of it. This list should be treated in a circular fashion. For example, given that the input list is [1, 2, 3, 4, 5] and k= 2: 1 maps to 3 3 maps to 5 5 maps to 2 2 maps to 4 4 maps to 1 Notice that when you get to element 5, 2 spaces in front of it is element 2. Notes: It will be useful to think about the input list as a circular list. That is, when you reach the end of the list, wrap around to the beginning. If an element in the list maps to itself, move to the next element. You can assume all elements in the input list are unique. def k_mapping (inp, k): INTERI Maps each element in the circular list to the element k spaces in front of it. >>> k_mapping ([1, 2, 3, 4, 5], 2) '1 -> 3, 3 - 5, 5 -> 2, 2 -> 4, 4 -> 1' >>> k_mapping ([1, 2, 3], 3) '1 -> 1, 2 -> 2, 3 -> 3