<p>How can I find time complexity (Big OH) in this code?</p><p>#define MAX 10</p><p><strong>int</strong> sum(<strong>int</strong> x[],<strong>int</strong> n, <strong>int</strong> odd)</p><p>{</p><p> </p><p><strong>if</strong>(odd==-1)</p><p>{</p><p>printf("odd = %d, even = %dn", sum(x, n, 1), sum(x, n, 0));</p><p><strong>return</strong> 0;</p><p>}</p><p> </p><p><strong>if</strong>(n%2!=odd)</p><p><strong>return</strong>