Write the complete runnnig time function for the attached program SUMODD for each statement write c$1,$ c$2$ etc and where appropriate n$,$ n$-1$ etc follow EXAMPLE FOR ASG$1$ in "COURSE MATERIALS" SHOW ALL WORK. FOR EACH STATEMENT, PUT C$1,$ C$2,$ ETC and n$,$ n$+1,$ n$-1$ if appropriate then gather like terms.USE THIS AS A GUIDE FOR ASSIGNMENT #$1.$ It IS NOT EXACTLY THE SAME AS THE ASSIGNMENT,

SO THE ANSWER IS NOT THE SAME

#includen$=0,$MAx$=0$;$,nA[n]=\{\}$;$,n+1ln>A[i]nMAx=$

$A[]$;$,C8(A[k]>$MAx$),$nMAx$=A[k]$;;$k=(C5+C6+C7+C9+C10+C11)n+C1+C2+C3+C4+C5+C8+C9+C12==an+bi=0$;$i$