Which notation describes the exact running time $($both upper and lower bounds$)$ of an algorithm? Question $17$ options: Big O $($O$)$ Big Omega $(\backslash$Omega $)$ Theta $(\backslash$Theta $)$ Little o $($o$)$