1. Implement a new version of mergeSort() where 3 sorted lists (instead of 2) of about the same size are merged.
2. No equations
3. here is what i have so far:
public final class Sort
{
/**
* Simple insertion sort.
* @param a an array of Comparable items...