K-Prob

You are given a string $S$ of length $n$ and an integer $K$. We will define $F(L)$ here. Let's choose $K$ random sub-strings of length $L$ from $S$. Then $F(L)$ equals the probability such that all of them are pairwise identical. See the **Explanation** section for more clarity. You have to find $F(L)$ for each $1 \leq L \leq n$. It can be shown that any $F(L)$ can be expressed as a f