Both hash tables and red-black trees can be used to implement symbol tables. Which one should you choose? Match the requirement on the left to the implementation on the right You write code for an auto-pilot. It is very important that all symbol table look-ups execute in the specified time [Choose] You write code for a game that uses a lot of animation. Speed is your first concern when selecting a symbol table implementation [Choose] Prof. Sedgewick introduced two ways to implement a hash table: separate chaining and linear probing. These methods have different advantages and disadvantages. Select typically has better cache performance Select is less sensitive to designed hash functions