Compute the time complexity of the following algorithm. You must explain how many operations are performed per call, how many calls to the algorithm are made, how many operations the algorithm performs in total, and what the order of the time complexity is. Algorithm func (n) performs c log n operations, where c is a constant. Algorithm algo(r) In: Root r of a proper binary tree storing n nodes ifr is a leaf then return n + func(n) else { } v func(n) v v + algo(r.leftChild()) + algo (r.rightChild()) return v