Which algorithm steps correctly solve the problem: How many occurrences of $2$ exist in the array?

$(1)$ loop through array $(2)$ inspect each array element $(3)$ increment counter if $2$ is found

$(1)$ loop through array $(2)$ increment counter if $2$ is found $(3)$ inspect each array element

$(1)$ inspect each array element $(2)$ loop through array $(3)$ increment counter if $2$ is found

$(1)$ increment counter if $2$ is found $(2)$ loop through array $(3)$ inspect each array element