In Python 3

5. Merging Sorted Lists Given two lists sorted in increasing order, create and return a merged list of all the elements in sorted order. You may modify the passed in lists. Ideally, the solution should work in "linear" time, making a single pass of both lists. In [14]: def linear_merge(listl, list2): Given two lists sorted in increasing order, create and return a merged list of all the elements in sorted order ### BEGIN SOLUTION ### END SOLUTION In 15]: from nose.tools import assert_ equal assert_equal ( linear merge (['aa', 'Kx ', "zz'], ['bb', 'cc']), ['aa', 'bb', 'cc', 'xx', 'zz')) assert_equal(linear merge( aa', 'xx' 1, ['bb, "cc', 'zz'1, 'aa', 'bb', cc, 'xx', 'zz']) assert_equal(linear_merge(', 'aa', I'aa', "bb', 'bb', ', 'aa', 'aa,'bb', bb'1)