The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:

The worst-case time complexities of the three sorting algorithms are:

1. Insertion Sort: When the input array is sorted in reverse order, each element has to be compared and shifted across the entire sorted subarray, leading to $\sum_{i=1}^{n-1} i = \Theta(n^2)$ time.

2. Merge Sort: Merge sort divides the array into two halves, recursively sorts them, and merges them in linear time. Its recurrence relation is $T(n) = 2T(n/2) + \Theta(n)$, which solves to $\Theta(n\log n)$ in the worst, best, and average cases.

3. Quick Sort: When the pivot selection consistently produces the most unbalanced partitions (e.g., $0$ and $n-1$ elements at each step, such as on an already sorted array with the first/last element as pivot), the recurrence becomes $T(n) = T(n-1) + \Theta(n)$, giving a worst-case time of $\Theta(n^2)$.

Thus, the respective worst-case running times are $\Theta(n^2)$, $\Theta(n\log n)$, and $\Theta(n^2)$.

Hence, the correct option is (D).