1. (20 POINTS) We w call a sequencebi,...h barely changing if neighboring numbers differ by at most 73 (that is, Wie 1, ,m-bbl S 73). Consider the following problem: INPUT: A sequence ai, OUTPUT: The length of the longest barely changing subsequence ofa, We would like to solve the problem using dynamic programming. Let Pl] = the length of the longest barely changing subsequence oti, , , , , q that ends with ai assume Give an expression (or a piece of code) that gives an efficient way of computing i 2 2)