IJalike a set, a sequence is an arrangement of elements in which positional information in which positional information is important. Write an SML fiunction, called isSufhirof, that takes as input two lists, L1 and L2, denoting sequences of L2 and returns false otherwise. and returns true if L1 is a suffix nd Cartationly speking, L is a sue f 2, if and only if it is posible to remove elements from the front of 12 and thereby obtain a result sequence L2' which is identical to L1 ssurnxut ti ,2,3] [1,2,3); (* true - removing zero elements from the front of L2 yeas that is identical to L1 isSuffix0f [2,3] 01,2,3]; true removing one element from the front ot L2 yields a that is identical to L1 removing tuo elements from the front of L2 yields a list that is identical to L1) removing three elements from the front of L2 yields a list that is identical to L1 *) isSuffixof [3] [1,2,3] ; (* 2211 true - isSuffixOf [] sSuffixof 13,2] 01,2,3]; false *)