Give C-like pseudocode for implementing the mergesort algorithm using OpenMP. This should be composed of two functions:

- void sort(int a[], int len, int aux[], int lo, int hi) where a is an array to sort, len is the length of a, aux is a temporary array with the same length as a, lo is the start of the region to sort, and hi is the end of the region to sort.

- merge(int a[], int len, int aux[], int lo, int mid, int hi) where the parameters are the same as above but includes a midpoint.

Do your best to parallelize whenever possible. For a sample implementation of Mergesort in Java, see here. Be sure to translate any Java syntax into C equivalents.