Please explain.

1.

2.

Assume that you are going to conduct BFS (= Breadth-First Search) for the following graph from the vertex a. Fill the mark array for the vertices e,f,g, and h as you learned in the lecture. When you traverse the graph, you should follow our convention (= alphabetical order of vertex characters). Consider the following Master Theorem T(n)=aT(n/b)+f(n) where f(n)(nd),d0 Master Theorem: If abd,T(n)(nlogba) Based on the above theorem, determine the time efficiency of the following formula T(n). T(n)=2T(n/2)+n (nlogn) None of these. (n2logn)