div class=trans-pagebuttonPage 1button div class=trans-image amp-img class=trans-thumb alt=Page 1: Scanned by CamScanner - Student Revise · b Write down BFS and DFS traversals starting at node A for the given graph Also draw BFS tree OR 10 a What is shortest path problem src=https:reader031fdocumentsusreader031viewer20220419045e62935ad3e3175b5f585707html5thumbnails1jpg width=142 height=106 layout=responsive amp-img divpScanned by CamScannerpdivdiv class=trans-pagebuttonPage 2button div class=trans-image amp-img class=trans-thumb alt=Page 2: Scanned by CamScanner - Student Revise · b Write down BFS and DFS traversals starting at node A for the given graph Also draw BFS tree OR 10 a What is shortest path problem src=https:reader031fdocumentsusreader031viewer20220419045e62935ad3e3175b5f585707html5thumbnails2jpg width=142 height=106 layout=responsive amp-img divpScanned by CamScannerpdivdiv class=trans-pagebuttonPage 3button div class=trans-image amp-img class=trans-thumb alt=Page 3: Scanned by CamScanner - Student Revise · b Write down BFS and DFS traversals starting at node A for the given graph Also draw BFS tree OR 10 a What is shortest path problem src=https:reader031fdocumentsusreader031viewer20220419045e62935ad3e3175b5f585707html5thumbnails3jpg width=142 height=106 layout=responsive amp-img divpScanned by CamScannerpdiv