Work out the computational complexity, in Big$-$O notation, of the following piece of code:

for$($ int bound $=1$; bound $<=$ n; bound $*=2)\{$

for$($ int i $=0$; i $<$ bound; i$++)\{$

for$($ int j $=0$; j $<$ n; j $+=2)\{$

$...//$ constant number of operations

$\}$

for$($ int j $=1$; j $<$ n; j $*=2)\{$

$\}\}$