Question $3$: $($CLO $2\mathrm{.}1)$

$(1\mathrm{.}5$ X $1=1\mathrm{.}5$ Mark$)$

Suppose you are tasked with implementing the back button functionality in a web browser. Users expect that they are taken to the previously visited web page when they click the back button. To implement this feature, you decide to use a stack data structure.

Question: How would you use a stack to implement the back button functionality in a web browser?

Below is the output that we would like to see.

Stack status: $[]$

Visiting webpage: Page $1$

Stack status: $[\text{'}$Page $1\text{'}]$

Visiting webpage: Page $2$

Stack status: $[\text{'}$Page $1\text{'},$ 'Page $2\text{'}]$

Visiting webpage: Page $3$

Stack status: $[\text{'}$Page $1\text{'},$ 'Page $2\text{'},$ 'Page $3^{\text{'}}]$

Navigating back to: Page $2$

Stack status: $[\text{'}$Page $1\text{'},$ 'Page $2\text{'}]$

Navigating back to: Page $1$

Stack status: $[\text{'}$Page $1\text{'}]$

Cannot go back further. Already at the beginning.

Stack status: $[\text{'}$Page $1\text{'}]$

Note$($ you should read the website link from the file$).$ We upload the file in the submission named links.txt$.$

Please write your code and submit it in a file called FirstName$\_$LastName$\_$question$3.$jav

Links.txt is this $3$ links