Merge sort algorithm is $\_\_\_\_\_\_\_\_,$ the worst case time complexity of sorting an array containing N elements with merge sort is $.$

Group of answer choices

stable, O$($N$2)$

unstable, O$($NlogN$)$

unstable, O$($N$2)$

stable, O$($NlogN$)$