Given the text T and pattern P below, count the number of comparisons necessary for searching for P in T using the KPM pattern matching algorithm. Also, show the failure function and the compares at each step in a tableT = CAGGAGAGGAGGTTGGAGGAP = GGAGGA