can someone help me do the code for this short function please?

IL Cunt Implement a function right_shift that will return a list of integers shifted to the right. A variable number of integer arguments will be provided. Assumption: The function should be able to take a variable number of positive integers as arguments. For the n number of provided integer arguments, you need to shift the first n-1 integers. . The number of positions to be shifted is defined by the last (nth) integer argument and those positions needed to be filled by the first (n=1) integer argument. If the number of positions needed to be shifted is greater than the number of integers to be shifted, then the positions will be replaced like before and the length of constructed list will also remain the same like before which is n-1. Return value: A List of shifted integersExample: List of integers to work on Number to fill the Number of positions shifted positions to be shifted Input: 0 1 3 4 5 7 8 3 Output List: 0 0 1 3 4 right_shift (0, 1, 3,4,5, 7,8,3) -> [0,0,0,0,1,3,4] right_shift(2, 1, 3,4, 5,1) -> [2,2,1,3,4] right_shift (0, 1, 3,4, 5, 7, 8,8) -> [0,0,0,0,0,0,0] right_shift (0, 1, 3,4,5, 7, 8, 11, 25, 5) -> [0,0,0,0,0,0,1,3,4]