Hello, I'd like some help with the following question. I'm really trying to understand the concepts so If you could explain what you're doing that would be great. thanks

3. (20 points) Suppose you are given an unsorted list of n distinct numbers. However, the list is close to being sorted in the sense that each number is at most k positions away from its original position in the sorted list. For example, suppose the sorted list is in ascending order, then the smallest element in the original lst will lie between position 1 and position k 1, as position 1 is its position in the original sorted list. Design an efficient algorithm that sorts such a list. Your running time should depend on both n and k (a helpful sanity check whether your running time bound is that, if k is close to n, then the list is just a generic unsorted list)