2. (30 points) Here is an SML mergesort program: fun merge ([], ys) = ys |...

Transcribed Image Text:

2. (30 points) Here is an SML mergesort program: fun merge ([], ys) = ys | merge (xs, []) = xs merge (x::xs, y::ys) = if xy then x::merge (xs, y::ys) else y::merge (x::xs, ys) = ([], []) fun split [] 1 split [a] 1 split (a::b::cs) = = ([a], []) let val (M,N) = split cs in end (a: :M, b::N) fun mergesort ( ) = [] | mergesort [a] = [a] mergesort [a,b] = if a 2. (30 points) Here is an SML mergesort program: fun merge ([], ys) = ys | merge (xs, []) = xs merge (x::xs, y::ys) = if xy then x::merge (xs, y::ys) else y::merge (x::xs, ys) = ([], []) fun split [] 1 split [a] 1 split (a::b::cs) = = ([a], []) let val (M,N) = split cs in end (a: :M, b::N) fun mergesort ( ) = [] | mergesort [a] = [a] mergesort [a,b] = if a