Yes that's right because
A) insertion sort would need O(n) space for data and O(n) stack space.
C) merge sort would take O(n) data space and O(n logn) stack space. Hint: it is an outplace algorithm
D) same as A
B) takes O(n) data space and O(logn) stack space in all cases except the worst.