$1.(5$pts$)$ Write pseudocode that will take in two different inputs $($one is a sequence of numbers $($arbitrary length$),$ the other one number$)$ input is a sequence s$1,...,$ sn and a value x$.($Assume that all the values are set of positive integers.$)$ The algorithm returns true if si $+$ sj $=$ x$,$ for some i $!=$ j$,$ and false otherwise. Example: If the input sequence is $2,12,6,14$ and x $=26,$ the algorithm returns true because $12+14=26.$If the input sequence is $2,12,6,14$ and x $=4,$ the algorithm returns false because no distinct pair in the sequence sums to $4.$Example: If the input sequence is $2,12,6,14$ and x $=26,$ the algorithm returns true because $12+14=26.$If the input sequence is $2,12,6,14$ and x $=4,$ the algorithm returns false because no distinct pair in the sequence sums to $4$