Using KMP algorithm, given a text T and pattern P$,$ find all occurrences of P within T:

T: AGCATGCTGCAGTCATGCTTAGGCTA

P: GCT

P appears three times in T$.$

Show the LPS $($the longest proper prefix of pattern$)$ table, searching process, and the indexes where there is a match.