What is the Big$-$O time complexity for finding the minimum element in an unsorted array of size n$?$

a$)$ O$(1)$

b$)$ O$($log n$)$

c$)$ O$($n$)$

d$)$ O$($n$^2)$