For the given problems, choose a data structure which is the best suiting to the problem: Stack, Hash Table, Priority Queue, Binary Tree, Directed Graph, Undirected Graph You can use ONLY these data structures to answer the following questions. One data structure can be used more than once in the answers. In addition, list the basic operations (search, insert, delete) for the data structure and report the Big-O running times of those operations. Problems: a) A technical support team requests where the most urgent IT problem will be resolved first. b) You will implement a memory exercising program, which should store several flash cards; each card has a question-and-answer pair. c) You have several Java code files; you need to find out the correct order in which to compile these files without getting any dependency error. d) The history list recording sites visited by the user of a web browser. As new sites are visited, they are added to the list. e) You are working as computer network administrator. You aim to find total number of reachable computers in a wired network architecture by sending a message to each computer. Some network wires might be comupted and so your control message cannot reach to specific computers in the network