While browsing the internet, you can click a hyperlink in a website to visit another page. No matter how many times a different hyperlink is clicked, you can always come back to the original page by clicking the back button.

a) Name the most efficient data structure that can be used in this application. b) Explain the implementation of the data structure named in Q3(a) based on the situation described in this question. c) Write the pseudocode: i. to store the URL of the previous page. ii. to retrieve the URL when the back button is clicked. d) Analyze the complexity of storing and retrieving the URLs. e) Describe the limitation of the data structure named in (a)