For which of the following input text T and pattern P in Boyer-Moore algorithm, the number of shifts of the pattern is maximum? Consider one shift for each time when the pattern shifted to a new index position for matching.T = 'abccaabdabcaabcc' and P = 'abd'T = 'abccaabdabcaabcc' and P = 'bca'T = 'abccaabdabcaabcc' and P = 'ccc'T = 'abccaabdabcaabcc' and P = 'abc'

To determine which input text T and pattern P in the Boyer-Moore algorithm will result in the maximum number of shifts for the pattern, we need to analyze each option.

1. T = 'abccaabdabcaabcc' and P = 'abd':

   • The pattern 'abd' appears twice in the text at positions 6 and 11.
   • The first occurrence requires 3 shifts to match, while the second occurrence requires 8 shifts.
   • Therefore, the total number of shifts for this pattern is 3 + 8 = 11.

2. T = 'abccaabdabcaabcc' and P = 'bca':

   • The pattern 'bca' appears twice in the text at positions 4 and 9.
   • The first occurrence requires 2 shifts to match, while the second occurrence requires 7 shifts.
   • Therefore, the total number of shifts for this pattern is 2 + 7 = 9.

3. T = 'abccaabdabcaabcc' and P = 'ccc':

   • The pattern 'ccc' does not appear in the text.
   • Therefore, the number of shifts for this pattern is 0.

4. T = 'abccaabdabcaabcc' and P = 'abc':

   • The pattern 'abc' appears twice in the text at positions 1 and 12.
   • The first occurrence requires 0 shifts to match, while the second occurrence requires 11 shifts.
   • Therefore, the total number of shifts for this pattern is 0 + 11 = 11.

Based on the analysis, the input text T = 'abccaabdabcaabcc' and pattern P = 'abd' will result in the maximum number of shifts for the pattern, with a total of 11 shifts.