CSC $236-$ Review of $162$ quiz

Describe the worst case running time of the following metho the variable $n.$ This should be the tightest bound possible.

I. void method$1($int $n,$ int $x)\{$

for $($int $)<mi\; id="EditorElement\_2588255">(</mi><mn\; id="EditorElement\_2588247">5</mn><mn\; id="EditorElement\_2588248">0</mn>$