<p dir="ltr"><img src="https://media.cheggcdn.com/media%2Fb23%2Fb236ecc3-5b60-4ade-8a38-9513dc1953bb%2Fimage.png" alt="1. [10 marks] For the following recurrence, prove using the substitution method (i.e. induction) that T(n) = O(2n). You can assume that no = 1, and the
<p>need help with Matlab (total newbie):</p><p>create a script to:</p><p>1. Calculate the area of a triangle with varying base and height(both arrays need to be the same size)</p><p>2. Compute the area