A binary maze consists of \(n\) separate rooms. Each room has a teleportation machine but no doors. The numbers \( a_{i,j}\in [n] \) are given for all \( (i,j)\in [n]\times \{0,1\} \). If you shout a number \( j\in \{0,1\} \) while you are in the room \( i \), then the teleportation machine will teleport you to the room \(a_{i,j}\).

You don’t know the numbers \(a_{i,j}\), but it is given that for any \(i\neq i’ \), there exists a way to reach room \( i’ \) from room \( i \) by shouting numbers \( 0 \) and \( 1 \) in some order.

At the beginning, your enemy will teleport you into one of the rooms while your eyes are closed. Your goal is to visit all rooms at least once with your eyes closed. As your eyes are closed, you don’t know which rooms you have visited before and you don’t know which room you are currently at.

So, you decide to pick a sequence \( b=(b_1,\dots, b_s) \in \{0,1\}^s \) before entering the binary maze and decide to shout the numbers \( b_1,\dots, b_s \) in order. Find a lower bound \( \ell(n) \) and an upper bound \( u(n) \) on the minimum length of a sequence which guarantees that you can visit all \( n \) rooms. If your \( \frac{u(n)}{\ell(n)} \) is smaller than some polynomial of \( n \) for all \( n\in\mathbb{N} \) , then you will get full points.