Show that for all positive integers m and n there are sorted lists with m elements and n elements, respectively, such that Algorithm 10 uses m + n ‒ 1 comparisons to merge them into one sorted list.

Will scan the signed document and attach to this one CLASS OBSERVATION NOTES (Attach extra sheets as necessary) Your name __________________________________________________ Honor Pledge (certifying that this is your own work) sign -______________________________________ Date ________________Class observed _______________________ Instructor _______________________ 1. (10...