Answer:
BFS uses Queue to find the shortest path. DFS uses Stack to find the shortest path. ... Time Complexity of BFS = O(V+E) where V is vertices and E is edges. Time Complexity of DFS is also O(V+E) where V is vertices and E is edges.
Explanation:
Answer:
The solution is given in the attachments.
Number three number three number three I’m not 100% sure though
Answer:
a) C= 1/120
b) P(X>=5) = 0.333
Explanation:
The attached file contains the explanation for the answers
It is habahi Yw with yuuuuuy I am a little more confused about
