Using the recursive method in problem 3 and assuming n is the length of the array. 1. Modify the recursion tree from the previous problem to show the amount of work on each activation and the row sums.
2. Determine the initial conditions and recurrence equation.
3. Determine the critical exponent.
4. Apply the Little Master Theorem to solve that equation.
5. Explain whether this algorithm optimal.

Solution: the categorization of functional and non-functional requirement are as follows: some of the more typical functional requirements include: • business rules• transaction corrections, adjustments and cancellations• administrative functions• authentication• authorization levels• audit tracking• external interfaces• certification requirements• reporting requirements• historical data• legal or regulatory requirementswhile,some typical non-functional requirements are: • performance – for example response time, throughput, utilization, static volumetric• scalability• capacity• availability• reliability• recoverability• maintainability• serviceability• security• regulatory• manageability• environmental• data integrity• usability• interoperability

What program is this in?

Iunderstand how you feels bad brother.