Please give the solution in C language only and attach the output screenshot

QA 23.7 Find the number of nodes with value greater than a given positive integer K in a given AVL

tree without using any extra space. Create a function countNodesGreaterThanK(currentNode, K)

which will count the number of nodes with values greater than K in the tree rooted at the current

node.

NOTE: A node with value K may or may not be present in the given tree.

Input Format:

Each line contains a character i followed by an integer separated by a space; a node with

this integer as key is created and inserted into the AVL tree.

Character c followed by an integer K separated by a space, is to count the nodes with value

greater than K in the AVL tree.

Character e is to exit the program.

Output Format:

First line contains the number of nodes with value greater than the given element, K.

Second line contains all the values greater than K, in sorted order, separated by space.

Constraints: 1 node.value 1000

1 K < max(node.value), where max(node.value) is the maximum value present in the AVL tree.

Sample Input:

i 30

i 20

i 40

i 10

i 25

c 20

i 50

c 20

e

Sample Output:

3

25 30 40

4

25 30 40 50