C language please..........

3-) (30 pts) Write a fuction that finds the sum of the value of the nodes at each level (height) in a given binary tree and add the result into a stack. This function will return the stack. You may use hight and push functions if needed. Hint: write a seperate function to find the sum at a specific level. Example: 20 17 12 2 11 4 stacks