The following algorithm seeks to compute the number of leaves in a binary tree. ALGORITHM LeafCounter(T )
//Computes recursively the number of leaves in a binary tree
//Input: A binary tree T
//Output: The number of leaves in T
ifT =∅return0
else return LeafCounter(Tleft)+ LeafCounter(Tright)
Is this algorithm correct? If it is, prove it; if it is not, make an appropriate correction.

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