[Solved]-1 Given Max Heap 30 25 20 23 18 19 14 16 13 12 11 17 Explain Using Pictures Deletemax 2 Co Q37213074

1 Given the max-heap 30, 25, 20, 23, 18, 19, 14, 16, 13, 12, 11,17, explain (using pictures) how to do DeleteMax. 2 Consider an undirected graph with vertices 1,2, 3,4 and the following cost matrix: 1 2 3 4 1 0 5 oo 2 Do 2 5 041 300403 4 2 1 3 0 Use Floyd’s algorithm to compute the costs of the minimum-cost paths between every pair of vertices. In other words, compute matrices D1, D2, D3, D.4 The last one, D4 contains the costs of the minimum-cost paths. Show work. Show transcribed image text 1 Given the max-heap 30, 25, 20, 23, 18, 19, 14, 16, 13, 12, 11,17, explain (using pictures) how to do DeleteMax. 2 Consider an undirected graph with vertices 1,2, 3,4 and the following cost matrix: 1 2 3 4 1 0 5 oo 2 Do 2 5 041 300403 4 2 1 3 0 Use Floyd’s algorithm to compute the costs of the minimum-cost paths between every pair of vertices. In other words, compute matrices D1, D2, D3, D.4 The last one, D4 contains the costs of the minimum-cost paths. Show work.

Expert Answer

---

Answer to 1 Given the max-heap 30, 25, 20, 23, 18, 19, 14, 16, 13, 12, 11,17, explain (using pictures) how to do DeleteMax. 2 Cons… . . .