Answer Happy

ОООООООО Application: An ice shelf in the Antarctic has just collapsed, and Miami will soon be flooded. We need to move the city, and everyone wants to move to San Diego where it is warm. Due to the volume of people and material to move we'll use railroad cars. We have a map of the railroad network with capacities of people and material that can be sent over each route between cities at the same time. You want to use the network to move as much people and material as possible. Make exactly two selections: the computational model you choose, and the time complexity for the main operations specified: A. Model: Array implementation of Heap for partial order B. Model: Dynamic Set ADT using Hashtable with chaining C. Model: Dynamic Set ADT with Binary Search Tree D. Model: Dynamic Set ADT with Red-Black Tree or Skip List E. Model: Flow network using Edmunds-Karp F. Model: Sorted List maintained with Randomized Quicksort G. Model: Union-Find ADT using forest with rank and path heuristics H. Model: Weighted Graph; Dijkstra's algorithm for shortest paths 1. Time: 0(1 + n/m) where m is an additional parameter you choose J. Time: O(E lg V) since it's connected K. Time: O(V E2) L. Time: O(a(V)), which is for practical purposes O(1) M. Time: O(lg n) for most operations; O(n) for listing contents N. Time: O(n Ig n) expected 0. Time: O(n) P. Time: O(n) to build it, Ollg n) to extract items ООООООО