Please write in python.Write a recursive function seq$\_$count $(x,...)$ that returns length of the longest subsequence of identical elements in the sequence object $x.$ Run:

seq$\_$count $([[1],[1],[1],1,3,3,2,2,4,0])$

seq$\_$count $((\text{'}$G$\text{'},\text{'}$g$\text{'},\text{'}$a$\text{'},"$a$","$a$",\text{'}\text{'}\text{'}$a$\text{'}\text{'}\text{'},2,\text{'}$s$\text{'},\text{'}$s$\text{'}))$

seq$\_$count $,$ int$($True$),1,1,1,3,3$

seq$\_$count $,$ None, $3,3,1,3,3,4,0$