$(30$ points$)$ Programming assignment. The starter code is provided on Moodle.

In this assignment, you will be implementing a solution to find the longest valid sequence of parentheses

using a linked list$-$based stack. Your implementation will involve two main parts:

Stack implementation: Develop a stack using a linked list, where the head of the linked list is

the top of the stack. This stack should support the following operations:

push: Adds an element to the top of the stack.

pop: Removes the element from the top of the stack.

peek: Returns the element at the top of the stack without removing it$.$

isEmpty: Checks whether the stack is empty.

Longest valid parentheses function: Implement the longestValidParentheses function. This

function should compute the length of the longest valid parentheses substring from a given input

string. The input string will consist only of the characters $"("$ and $")".$ Your function should

return the length of the longest well$-$formed parentheses substring.

In the longestValidParentheses function, you will need to use if$-$else logic within a for loop

to process the string and determine the longest valid sequence.

Below shows some examples:

Notice:

Follow the comments in the provided code template carefully and implement your code accordingly.

Do not add any new functions.

Do not include any additional libraries.

Do not make changes to the given code.

Do not include a main function in your submission.

You need to submit the AssignmentOne.java file to Moodle.

class Node