Can you write a recursive c program that takes as an input a total of N integers and prints every subtotal that has a sum equal to zero (if exists). Also mention its complexity ex. input:N = {-10, -3,...

Can you write a recursive c program that takes as an input a total of N integers and prints every subtotal that has a sum equal to zero (if exists). Also mention its complexity

ex.

input:N = {-10, -3, 1, 2, 4, 6)

output: {-10, 4, 6}, {-10, -3, 1, 2, 4, 6}, {-3, 1, 2}