Consider the tree Collision Resolution Protocol $($CRP$).$ Let exactly k collisions occur during a collision resolution phase. Determine the number of slots required for terminating the collision resolution phase as a function of k$.$ Note that k does not represent the number of packets that have initially collided, but the number of collisions in the CRP feedback pattern $(.$e$.,$ the number of e$\text{'}$s$).$