Write a program that can handle duplicate nodes in a binary search tree as follows: include a field in the structure of each node that will contain a count of the number of occurrences of a particular value. Increment the count by one when inserting a value that is already in the tree. Decrement the count by one when deleting a value in the tree for which the count is greater than one. Be sure to handle the case where the count is decremented to zero. Print out the inorder sequence after each insertion and deletion. When a node has a count greater than one, print the node "count" number of times. For example, an inorder sequence for the tree in Fig. 1, may look like: A B B C D D D E. D 1 Fig. 1. Binary search tree with additional member named "count" in node struct.