I Given a binary tree of integers write a routine which will accept a pointer to the tree, traverse the entire tree and return a pointer to the smallest element (the element whose info field contains the smallest integer) of the tree as well as the number of nodes in the tree that have both right and left sons. ?. Given a singularly linked list write a routine which will read the information field of each node (which is an integer) and create two separate singularly linked lists. One list will be made up of all the nodes whose information field contains an even integer and the second list will be made up of all the nodes whose information field contains an odd integer. II Convert the following expressions to both Prefix and Postfix / Infix and create the binary trees which represent them A. P (Q+R)+SIT W-X*Y+Z B. (A+B)*C+D E)/F/G/H+I Write a routine which will accept a character string as input and determine if it is in the form of X C Y where X is a string consisting of the letters 'A'and 'B' and Y is the reverse of X. (That is if X = 'ABBAB. then Y-BABBA. At each point in the routine you may read only the next character of the string. The 'C' is the delimiter for X' and 'Y') IV V. Given a doubly linked list write a routine which will travel through the list adding 10 to every node whose information field is an even number and then travel backwards thru the list subtracting 4 from every node whose information field contains an odd number