Design sort-based and hash-based algorithms for computing the relational division operation (see Practice Exercise 2.9 for a definition of the division operation).

Create and test assumptions regarding the running times of insertion sort and selection sort for arrays with just two key values, assuming the values are equally likely to occur.

Fill in the blanks

Sorting can be solved by using support of this data structures.   hash table heap linked list  all of the options

Question 6  Show the loop invariant of Merge Sort. Initialization, Maintenance, and Terminantion Show the loop invariant of BFS. Initialization, Maintenance, and Terminantion Show the loop invariant of DFS. Initialization, Maintenance, and Terminantion  Full explain this question and text typing work only thanks