Assume that you are given an array list[n] of floating-point (decimal) data type of size n and an equation px+q=r, where p > 0. Using Linear search algorithm, write a pseudocode that scans through the given array list[n] for a solution of the given equation px+q=r. If the solution exists, your algorithm should output the position at which solution occurs in the array else it should output -1.