using python

3. Write a function jscore(sl, s?) that takes two strings sl and s? as inputs and returns the score of sl compared with s2 i.e., the Jotto number of characters in sl that are shared by s2. The positions and the order of the shared characters within each string do not matter. Repeated letters are counted multiple times, as long as they appear multiple times in both strings. For example: jscore( 'diner' , jscore( 'always' , 1 3 3 8 # just two one the 'a's 'a', and one j score( ' syrup ' ' bananas ' 'always' , 'walking' jscore( ' recursion ' j score( ' recursion ' ' excursion ' everything but t because s2 is Notes/hints: Unlike the words in traditional Jotto, which always have five letters, there are no restrictions on the lengths of the input strings sl and s2. If either sl or s2 is the empty string, the Jotto score is 0. You can write the function any way you like as long as you use functional programming. We encourage you to consider using one or more helper functions. In particular, one possible approach involves using a