$($f$)$ What is the Big O complexity of the Java method below? Explain $[3$ marks$]$

your reasoning.

public void complexity $($int $n)\{$

int counter $=0$;

for$($int $i=n$; $i>500$; $i--$

for $($int $j=6$;$j<msup\; id="EditorElement\_109972"><mrow><mn\; id="EditorElement\_109961">6</mn></mrow><mrow\; id="EditorElement\_109971"><mi\; id="EditorElement\_109964">*</mi><mi\; id="EditorElement\_109966">*</mi><mi\; id="EditorElement\_109968">*</mi></mrow></msup><mi\; id="EditorElement\_109974">n</mi>$;$j=j+n)\{$

counter$++$;

$\}$

$\}$

$\}$