Let b n be a sequence defined by the following recurrence relation:

$$ b $1=3$

$$ b n $=3$bn$1+2$ for all n$>1$

a$)$ Prove using induction that bn $<=4$ n n$>=1$

b$)$ Write the pseudocode to compute bn and then prove the correctness of your code