Given an unsorted array. The array has this property that every element in the array is at most $k$ distance from its position in a sorted array where $k$ is a positive integer smaller than the size of an array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity? $(7)$

a$)$ Insertion Sort with time complexity $O(kn)$

b$)$ Heap Sort with time complexity O$($nLogk$)$

c$)$ Quick Sort with time complexity O$($kLogk$)$

d$)$ Merge Sort with time complexity $O(kLogk)$