Write a function pattern$\_$count$($x$,$ pattern, $...)$ that takes the two iterable objects x and pattern and returns the length of the longest subsequence of pattern. Run:

pattern$\_$count$(\text{'}$CGGACTACTAGACT$\text{'},$ 'ACT'$)$

pattern$\_$count$((1,(1,1,1,1),2,1,1,1),[1,1])$

pattern$\_$count$([\text{'}$ab$\text{'},\text{'}$ab$\text{'},\text{'}$a$\text{'},\text{'}$a$\text{'},\text{'}$b$\text{'}],(\text{'}$ab$\text{'},))$