Consider design of hash table algorithms because these data structures offer the greatest potential for improvement. How can you be able to efficiently use hash tables in Operating System design which will help CPU scheduling, memory (pagetables), and disk management? Give the complete design and justify size and runtime efficiency. How can you extend the same idea to distributed systems?