For the following problems, circle the correct answer 8. (1 pt) Which data structure is used to execute Breadth-First Search? stack queue priority queue hash table 9. (1 pt) Which data structure can be used instead of recursion to execute Depth-First Search? stack queue priority queue hash table 10. (2 pts) Which data structure is used to execute Dijkstra's Algorithm? stack queue priority queue hash table n to be secure and practical: (a) (1 pt) Solving for y in the equation y "mod p when z, n, and p are known must be: easy hard (b) (1 pt) Solving for n the equation y" mod p when y, z, and p are known must be: easy hard