A$.$ Create a Next table for the pattern $"$cpsc$501$cpsc$502"$

B$.$ For the below given table, fill the empty values with the correct values and explain why those values are correct.

C$.$ Complexity of Brute force Approach for Pattern Matching is $\backslash (\backslash$underline$\{\backslash$underline$\{$O$\}\}(\backslash$mathrm$\{$~m$\}.\backslash$mathrm$\{$n$\})\backslash )$ where $\backslash (\backslash$mathrm$\{$m$\}=\backslash )$ length of pattern, $\backslash (\backslash$mathrm$\{$n$\}=\backslash )$ length of text. Explain the complexities of KMP algorithm and complexity of creating a Next table.