Best case cost refers to a best problem instance AS THE INPUT GETS BIG.

So it makes no sense to talk about a growth rate or a best case of a fixed input size.

The best case for sequential search occurs when the first element of the array (for whatever size) is the value being searched for.