Please write in python.$($b$)$ Write a function pattern$\_$count $,$ pattern, $...)$ that takes the two Rerable objects $x$ and pattern and retums the length of the longest

subsequence of pattern $.$ Run:

$patter{n}_c$ount$(\text{'}CGGACTACTAGACT\text{'},$ 'ACT'$)$

$patter{n}_c$ount $((1,(1,1,1,1),2,1,1,1),[1,1])$

$patter{n}_c$ount $({[}^{\text{'}}a{b}^{\text{'}},{?}^{\text{'}}a{b}^{\text{'}},{?}^{\text{'}}{a}^{\text{'}},{?}^{\text{'}}{a}^{\text{'}},b^{\text{'}}],{(}^{\text{'}}a{b}^{\text{'}},))$

$($c$)$ For a long string, write code that takes strings $x,$ pattern $,$ and an integer $n_{?}$splits, and uses a suitable concurrency method to search for repeating

patterns using pattern$\_$count from $($b$).$ To this end, partition $x$ into $n_s$plits parts and search each of them individually. Make sure not to spil where a

pattern is present Run:

fron randon import choices, seed

seed $(2$e$24)$

x $="\text{'}.$ join$($cholces $("01\text{'},$ k $=5\_080))$

pattern $="$e$1"$

n$\_$splits $=50$

# here is your code

Hint: You can use the fast $x.f$ ind $($pattern$)$ to check your code.