3.(a) Write an algorithm that counts the number of nodes of a binary search tree (BST) whose values are less than a given value x. b) Write an algorithm that can delete any node in a maxheap and the resultant heap remains as a maxheap. Write a divide-and-conquer algorithm that returns the sum of nodes' values in a binary tree which are larger than a given value x. (c)