Return a new list that rotates the input integers to the right by the requested number of steps. Do not modify the original list. Treat the step count as non-negative and normalize values larger than the list size. Return null when the input list is null.

Examples:

List<Integer> values = new List<Integer>{ 1, 2, 3, 4, 5 };
List<Integer> rotated = rotateRight(values, 2);
// Results: [4, 5, 1, 2, 3]

List<Integer> same = rotateRight(values, 5);
// Results: [1, 2, 3, 4, 5]

Hints:

• Guard against null input before attempting to rotate
• Use modulo to normalize the number of rotation steps
• Build the result in a new list to avoid mutating the source data
• Concatenate the tail segment before the head segment when rotating right