Given a positive real number a1a_1a1 , we recursively define an+1=1+a1a2⋯⋅an.a_{n+1} = 1+a_1 a_2 \cdots \cdot a_n.an+1=1+a1a2⋯⋅an. Furthermore, let bn=1a1+1a2+⋯+1an.b_n = \frac{1}{a_1 } + \frac{1}{a_2 } +\cdots + \frac{1}{a_n }.bn=a1 Prove that bn<2a1b_n < \frac{2}{a_1}bn<a12 for all positive integers nnn and that this is the smallest possible bound.