You are in a classroom with $n$ students. Exactly one of the student have a pen,

you don't know who. Your task is to determine which student have the pen.

You can questions to one student at at time and they can only answer yes$/$no$.$

A student who does not know where the pen is will always answer no$.$

$5\mathrm{.}2$

Now assume that the student who has the pen knows it$.$ Describe how to find

the pen asking $O(n)$ questions.

$5\mathrm{.}3$

Now assume all the students knows who has the pen. Describe how to find the

pen asking $O(logn)$ questions.

I wrote answers for this step by step but im not sure if its correct, because i dont know if i should write code or basic steps. I wrote that they were linear search and binary search algorithms