Assignment$)$ Running Complexity in BigO

$($A$01)$ print "hello";

$($A$02)$ print "hello";

print "hello";

print "hello";

$($A$03)$ for $($int i $=1$; i $<=$ n; i $+=$ c$)\{//$ Here c is a positive integer constant

$//$ some O$(1)$ expressions

$\}$

$($A$04)$ for $($int i $=$ n; i $>0$; i $-=$ c$)\{$

$//$ some O$(1)$ expressions