You are given an n x m grid which contains lower case English letters. How many times does the phrase "saba" appear horizontally, vertically, and diagonally in the grid? Input Format: First line: Two integer n and m, where n denotes (1 <= n,m <= 100) the number of rows and m denotes the number of columns in the grid Next n lines: Each line must contain a string of length m which contains lower-case English letters only For Example: A sample dialogue (input) is: Enter n value: 5 Enter m value: 5 Enter 5 lines of 5 characters: safer amjad babol aaron songs This input will be stored in a 2D array of n x m a f e S a b a S r a d O 1 a r O n O n g S و | 3 | بوا بم m j a b Output Format: Print the number of times the word "saba" appears in the grid. As an output of the above sample data the word "saba" appears 3 times. Also, compute the time complexity of your program in terms of Big-Oh.

You are given an n x m grid which contains lower case English letters. How many times does the phrase "saba" appear horizontally, vertically, and diagonally in the grid? Input Format: First line: Two integer n and m, where n denotes (1 <= n,m <= 100) the number of rows and m denotes the number of columns in the grid Next n lines: Each line must contain a string of length m which contains lower-case English letters only For Example: A sample dialogue (input) is: Enter n value: 5 Enter m value: 5 Enter 5 lines of 5 characters: safer amjad babol aaron songs This input will be stored in a 2D array of n x m a f e S a b a S r a d O 1 a r O n O n g S و | 3 | بوا بم m j a b Output Format: Print the number of times the word "saba" appears in the grid. As an output of the above sample data the word "saba" appears 3 times. Also, compute the time complexity of your program in terms of Big-Oh.