Please convert this c# code to pseudecode. private static List MergeSort(List unsorted) { if (unsorted.Count 0 || right.Count > 0) { if (left.Count > 0

Please convert this c# code to pseudecode.

private static List MergeSort(List unsorted) { if (unsorted.Count <= 1) return unsorted;

List left = new List(); List right = new List();

int middle = unsorted.Count / 2; for (int i = 0; i < middle; i++) //Dividing the unsorted list { left.Add(unsorted[i]); } for (int i = middle; i < unsorted.Count; i++) { right.Add(unsorted[i]); }

left = MergeSort(left); right = MergeSort(right); return Merge(left, right); }

private static List Merge(List left, List right) { List result = new List();

while (left.Count > 0 || right.Count > 0) { if (left.Count > 0 && right.Count > 0) { if (left.First() <= right.First()) //Comparing First two elements to see which is smaller { result.Add(left.First()); left.Remove(left.First()); //Rest of the list minus the first element } else { result.Add(right.First()); right.Remove(right.First()); } } else if (left.Count > 0) { result.Add(left.First()); left.Remove(left.First()); } else if (right.Count > 0) { result.Add(right.First());

right.Remove(right.First()); } } return result; }