What is the time complexity of the foo method? Write your answer as Theta, O$,$ or Omega of g$($n$)$ in parentheses with NO SPACES.

Examples: Theta$($n$^2),$ O$($nlgn$),$ Omega$($n$)$

public static int foo$($int n$)\{$

int result $=0$;

for $($int i $=0$; i $<5$; i$++)\{//$ Loop A

for $($int j $=0$; j $<8$; j$++)\{//$ Loop B

result $+=$ i $+$ j;

$\}$

$\}$

return result;

$\}$