please send help to answer this question below. need the answer within 30min please.

Knuth-Morris-Pratt's (KMP) algorithm preprocesses the pattern to find matches of prefixes of the pattern with the pattern itself.

 a)      Compute the values of the KMP Failure Function for the following String:

                      cabcabc

[7 marks]

b)      Demonstrate the string matching using KMP Algorithm to find two occurrences of the string cabcabc in the given string below.

                   a b c a b c a b c a b c b