29 août 20193 août 2020 Bastien Pasdeloup A min-heap contains the following (key, value) couples: (A, 25), (B, 37), (C, 5). What is the next couple that will be removed? (B, 37). (C, 5). (A, 25). A min-heap contains the following (key, value) couples: (A, 55), (B, 22), (C, 32), (D, 87). Select the correct assertions: If performing add or replace with (A, 32), the resulting status will be (A, 32), (B, 22), (C, 32), (D, 87). If performing add or replace with (B, 53), the resulting status will be (A, 55), (B, 53), (C, 32), (D, 87). The next element to be removed is (B, 22). The next element to be removed is (D, 87). If performing add or replace with (D, 86), the resulting status will be (A, 55), (B, 22), (C, 32), (D, 86). The Dijkstra algorithm can be implemented... using a min-heap, by storing vertices as values, and distances to the starting position as keys. using a min-heap, by storing vertices as keys, and distances to the starting position as values. using two min-heaps, one for the edges, one for the vertices. Time is Up!