Int someFct (int N)[
if (N <=2) {return 0;}
if (%2==0) [return (5+somedFct (N/2));}
else {return (4*someFct (N-3));}
}
a) (5) Show tree of fct for N = 7?
b) Give the recurrence formula for the above code.
Base case(s) formula:

Recursive case recurrence formula as derived directly from the code. You should get a somewhat weird recurrence. Do NOT try to solve it. Hint: how do you write the function expression for absolute value of any real number x (|x| = )?

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;