You are given a function, f$($n$)=7$n$^(3)+9$n$+5,$ representing a code fragment's actual runtime complexity. "The big theta $(\backslash$theta $)$ complexity of the function is n$^(2)."$ Justify the argument using your own words. You will be given N numbers, and each number can be either positive or negative. You need to calculate the number of non$-$repetitive positive even numbers observed in your input. You also need to analyze the memory complexity in terms of Big $0$ for your proposed solution.