Determine the complexity of an algorithm checking for duplicates in an array by considering the best and worst case performance.

Find the number of operations performed in Snippet $1\mathrm{.}4$ for both the worst and best cases. There is no need to work out the algorithmic complexity in big O notation. Assume that the inner loop results in eight operations every time it executes. For the outer loop, assume four operations:

public boolean containsDuplicates$($int$[]$ numbers$)$

$\{$

for $($int i$=0$; i