What's the running time of the following algorithm:

def fun$1($text$)$:

text $=$ text $**2$

print$($text$)$

$O(n)$

$O(1)$

$O(logn)$

$O(4n)$