1. Analyze the following properties of BFS and DFS for an Acyclic Tree without making any assumptions.
a.) Optimality
b.) Completeness
c.) Space Complexity
d.) Time Complexity
Propose an algorithm which is a hybrid of both BFS and DFS and ensures better characteristics compared to both BFS and DFS.
2. Modify Prim's or Kruskal's algorithm to find a diameter bounded minimum spanning tree of a complete graph. A diameter bounded minimum spanning tree is a spanning tree having least cost and diameter not greater than a bound .
3. Compare and contrast among Dijkstra's Algorithm, Ford Algorithm and WFI Algorithm to find shortest path.