(first two maximum numbers) write an oz function which has at its input a list of integers and returns the maximum element. for example, {max [3 ~2 0 4 5 1]} should return 5. the optimal algorithm for determining the maximum element of a list with n elements is doing n-1 comparisons. write an oz function which has at its input a list of integers and returns the first two maximum elements. for example, {max [3 ~2 0 4 5 1]} should return 5 and 4. what is the optimal number of comparisons needed? try to write an

According to alisa miller foreign news bureaus

If an improvement creates no significant change in a product’s performance, then it is a(n) ? a0 design improvement. (there are no answer choices)

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;