Which of the following describes an algorithm that will always execute in the same amount of time regardless of the size of the input data set?

Big $O(1)$

$O(n^{{?}^{{?}^{?}}}2)$

$O(logn)$

$O(n)$