What is the time complexity of the following algorithm?

$```$

void displayRecursiveSequence$($int n$)\{$

if $($

return;

$\}$

displayRecursiveSequence$($n $/4)$;

int current$\_$element $=2*$ n;

std::cout $$ current$\_$element ;

$\}$

$```$

O$($log$\_4\_$n$)$

O$($c$)$

O$($log$\_2\_$n$)$

$\backslash ($ O$\backslash$left$(2^\{\backslash$wedge$\}$ n$\backslash$right$)\backslash )$

$\backslash ($ O$\backslash$left$($n$^\{\backslash$wedge$\}2\backslash$right$)\backslash )$