Question $32$ pts

Select tight big$-$Oh expressions for the worst$-$case running time and space complexity of the ADD$$function $($Algorithm $2).$

Time: $[$ Select $]["$O$(1)","$O$($n$^2)","$O$($log n$)","$O$($n log n$)","$O$($n$)"]$

Space: $[$ Select $]["$O$($n log n$)","$O$($log n$)","$O$($n$)","$O$(1)","$O$($n$^2)"]$