Q$8$: Solve this Recurrence equation using $n=2^k$

$T(n)=\{\begin{array}{cc}c,& n=1\\ 4T(\frac{n}{2})+nlogn,& n>1\end{array}$

Q$9)$ Apply the DFS$-$based algorithm for the following graph

Q$10)$ Write a BF algorithm to check if the two strings have the same characters but not necessary in

the same order. For example, "army" and "mary", both have the same characters.

What is the time complexity? Can we do better? If yes, How?

Q$11)$ How do you find the missing number in a given integer array of $1$ to $100.$ Can you solve it in

$O(n)$ time complexity? If yes, how? If no$,$ why?