Must be written in Scala

We define a function shufflestring(s: string): string that, given an input string s, does the following: If the string s is empty or length 1, the result is the same as input string s. Let n be the length of s. Recursively call shufflestring on the substring s (n/2) Concatenate s1 to the first half s(e)s(n/2-1) to the result of the call. s(n-1). Let s1 be the result Here is an implementation of this function and some examples, for your reference. def shuffleString (s: String): String t val n s.length if (n