What is the worst case compitational complexity of the following code snippet in terms of Big O notation?result $=0$for $($int i $=0$; i $<$ n; i$++)$result $+=1$:for $($int j $=1$; j $<$ m; j $*=2)$result $*=$ j;O O$($log m$)$O O$($n$)$O O$($n $+$ log m$)$O O$($n $+$ m$)$