The basic operation build$($a$,\backslash ($ n $\backslash ))$ creates an array of length $\backslash ($ n $\backslash )$ and initializes it with the values provided in the set $\backslash ($ a $\backslash ).$

It can be stated that the operation $`$build$`$ described above executes in constant time.

$($To be exact: the asymptotic upper bound on the worst$-$case running time of 'build$`$ is constant regardless of changes in input size$)$

True

False