Q$1\mathrm{.}110$ Points

Grading comment:

Merge Sort is a divide$-$and$-$conquer algorithm $($breaks up the solution into subparts and solves it recursively$)$ and continuously splits the list in half per recursive iteration. Briefly $($in one sentence$)$ state the Merge Sort algorithm's base case.