Question: Question 1. [ 3+2+2+3=10 points] Part a. [3 points] Draw a directed weighted graph for the following edge-list. Do a BFS and DFS run starting
![Question 1. [ 3+2+2+3=10 points] Part a. [3 points] Draw a](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f04fa3b3197_05966f04fa353eb7.jpg)
Question 1. [ 3+2+2+3=10 points] Part a. [3 points] Draw a directed weighted graph for the following edge-list. Do a BFS and DFS run starting at 0, considering the lowest weighted edge for choosing the next vertex. Part b. [2 points] Given the Alg2 method, show the recursion trace for Alg2 (0,32) call. Give the estimated run-time as a function of time T(n) and Big-Oh. public static int Alg2(int m,, int n) \{ if ( n=1) return m; else return m+Alg2(m,n/2)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
