Using Prolog, does anyone know how to do this one? Thank you!

Write a predicate msort that sort a list of integers using the merge sort method. Merge sort splits a list into two halves, recursively sorts each half and then merges them back together. You should expect to write a number of predicates for this question. ?- msort ([4, 5, 3, 2, 2], M). M = [2, 2, 3, 4, 5]