must be written in Scala please

def shuffleString(s: String): String val n s.length() if(n <: s else val secondhalfs.substring n shuffledhalf shufflestring firsthalf s.substring return feshufflestring f1-shufflestring f2shufflestring f3 f4shufflestring f5shufflestring implement a tail recursive version of using an accumulator variable. it will help to carefully examine how different parts the string get rearranged design this function or even first try write simple while loop that mimics def tailrecursiveshufflestring acc: code here assert test passed failed>