What is the best case count of the number of primitive operations executed by the following algorithm?

$12345678$

Algorithm arrayMax$($A$,$n$)$

$//$ Input array A of n integers

$//$ Output maximum element of A

currentMax$$A$[0]$

for i $1$ to n $-1$ do

if A$[$i$]>$currentMax then

currentMax$$A$[$i$]$

return currentMax

$4$n $-2$

$5$n

$5$n $-2$

$7$