Question: $5$

I need step by step answer for my better understanding

What is the time complexity of the merge sort algorithm?

A$.$ O$($n$)$

B$.$ O$($n log n$)$

C$.$ O$($n$^2)$

D$.$ O$($log n$)$

If You Write AI Answer $-$ I will give $15$ Dislikes For Sure.