Discussion Post
• Suppose you are given a flow network N and a maximum flow f for N. Suppose d, a positive integer, is added to the capacity of one edge of N.
o Give an efficient algorithm to compute a maximum flow for the new network.
o What is the worst case time complexity of your algorithm?
• In a heap, the heights of the left and right subtrees of a node differ by atmost 1.
o The best case running time of Bubble Sort is O(n).
o The best case running time of Merge Sort is O(n).
o The worst case complexity of Quick Sort is O(n2).
o The worst case complexity of AVL Tree insertion is O(n).
The response must include a reference list. One-inch margins, double-space, Using Times New Roman 12 pnt font and APA style of writing and citations.