Problem $5$ Design an algorithm that takes a list of integers as input J$A=(a1,a2,a3,a4,a5,$dots,$an)$ along with a target value $x.$ Your algorithm must locate a

pair of integers in A that sum to the value $x$ or report that there is no such pair. For example if $A=(1,11,-2,12,8,9)$ and $x=10,$ then your algorithm should

report back either $(1,9)$ or $(-2,12).$ Write your algorithm out in Java pseudocode $($bulleted english is fine$).$