Consider the search tree below, in which the dark node represents the solution.

$($a$)$ DFS with one processing clement

$($b$)$ DES with two processing elements

a$.$ If a sequential search of the tree is performed using the standard depth$-$first search $($DFS$)$ algorithm, how much time does it take to find the solution if traversing each arc of the tree takes one unit of time?

b$.$ Assume that the tree is partitioned between two processing elements that are assigned to do the search job. If both processing elements perform a DFS on their respective halves of the tree, how much time does it take for the solution to be found? velyat is the speedup? Is there a speedup anomaly? If so$,$ can you explain the anomaly?