9 Set operation Given SetA ta, d. f.k.t,b, p) and seth-(b, h, f, y, k).f (A)...
7. Given a set of n activities with start time and finish time F; of an i activity. Find the maximum size set of mutually compatible activities. Implement following string matching algorithms and analyze time complexities: 8. a) Naïve method b) Rabin karp Algorithm c) Finite state Automaton algorithm 9. A hash table is a data structure used to implement an associative array, al structure that can map keys to values. Implement Hashing using Linear and Quadratic Probing.