Write a function that merges two sorted array-based lists into one sorted array-based list. The function takes two arrays as parameters, each holding a sorted list of integers, merges them into a single sorted list, and returns the result. Note that this function performs the merge part of the merge sort algorithm. The function should have a linear time complexity i. e. O(N), where N is the sum of the length of the two input lists it merges. Note: functions that are not linear will not get any credit. Deliverables: A copy of your merge function code in a text file. A copy of a test program to test your function. Be sure to test all cases e. g. two empty lists, one empty only, lists with 1 element each, lists with multiple elements. Screenshots of your test runs showing your function meets specifications.

Write a function balancechemical to balance chemical reactions by solving a linear set of equations. the inputs arguments are: reagents: symbols of reagents in string row array products: symbols of products in string row array elements: elements in the reaction in string row array elcmpreag: elemental composition of reactants in two dimensional numeric array elcmpprdcts: elemental composition of prducts in two dimensional numeric array hint: the first part of the problem is setting up the set of linear equations that should be solve. the second part of the problem is to find the integers from the solution. one way to do this is to mulitiply the rational basis for the nullspace by increasing larger integers until both the left-and right-side integers exist. for example, for the reaction that involves reacting with to produce and : reagents=["ch4", "o2"]; products =["co2", "h2o"]; elements =["c","h", "o"] elcmpreag=[1,4,0;