Derive the respective closed$-$form T $($n$)$ for the number of times the function Bar is called.

$1$: function SuperbCount$($n : Z$+$power of $2)$

$2$: count $0$

$3$: for i from n to $1$by dividing by $2$do

$4$: for j from $1$to i do

$5$: count $$Bar$($i $+$j$)$

$6$: end for

$7$: end for

$8$: return count

$9$: end function