1 hour left plz answer this fast

Q1. You are part of a team developing a next-generation web server tool. You are required to make decisions on the usage of appropriate data structures as per the requirements. The objective of this next-generation web server tool is to exploiting GPUs in order to deal with tons of web requests. We are maintaining a separate structure for each GPU. At the time of receiving a new request, a process is created and a process ID is assigned for the process. The request is then sent to a respective list of GPUs in order to process. In order to handle multiple requests and avoid blockage, it has been decided that a request will be allocated for 10 seconds - if the request is not finished in 10 seconds then we have to store the request again in the list to process again. a) which data structures (array or linked list) would be more efficient to use in this scenario and why? b) Which ADT (List/ Stack/ Queue) we should use and why? c) List down required operations of ADT (not all operations of ADT, unless it is required). Also identify the Big- of operations by using your selected data structure