What is the overall time complexity of the merge sort algorithm?A. O(n log n)B. O(log n)C. O(n)D. Olog(n)Leave a ReplyCommentEnter your name or username to commentEnter your email address to commentEnter your website URL (optional)