Consider Java searching Algorithm

Input: A sequence of $n$ numbers $(a_1,a_2,$dots,$a_n)$ stored in array $A[1$:$n]$ and a value $x.$

Output: An index i such that $x$ equals $A[i]$ or the special value NIL or null if $x$ does not appear

in $A.$

Write Java code for linear search, which scans through the array from beginning to end, looking

for a numerical value within an array containing numbers and returns the index where it is

located within the array.

This function must reply with a value regardless of whether you found it or not.

You must prove that your algorithm is correct and make sure that your loop invariant

fulfills its necessary properties.

Use a method in your Java code for this search functionality.

No user input is required. Create the sequence of numbers array and the value to be

found as variables, and pass it into the function and then display the result as output.

You must include comments and details for each line of code what they are doing