I WILL GIVE DISLIKES $!!!$ IF ANYTHING WRONG HAPPENS IN MY QUESTION, BETTER SKIP IT$!!!$ What is the complexity of given code chunk below? VD$15$ public static boolean whoknows$($String word, String searched$)\{$ if$($word$.$contains$($searched$))$ return true; return false; Your answer: O O$($log n$)$ O $0(1)$ O O$($n$^3)$ o O$($n$)$ Clear answer Submit