Design and analysis- Merge sort question

Will appreciate and rate a detailed answer

(10 points). The Merge Sort algorithm recursively divides the input array in hall, and then merges the two sorted halves. Consider a new algorithm, Merge3 Sort, which recursively divides the input array in thirds, and then (linearly) merges the sorted thirds. Describe the running time of this operation using a recurrence relation