Using recursion with C++. Word can be found south, north, east, and west but no diagonals.

In this problem you will build a word search solver. Given a grid of characters and a target word, find all occurrences of a target word (of at least 2 characters) in the grid either vertically or horizontally (in either direction) by listing the row and column (using O-based indexing) where the first character starts and in what direction the word extends. For example, given the grid below and the target word snow the output should be as shown apsdz c d n ib snow a Desired output for the target word snow should be: snow starts at (row, col)(0,2) and proceeds down. snow starts at (row,col) -(2,0) and proceeds right. For the target word won the output should be: won starts at (row, col) (2,3) and proceeds left. won starts at (row,col) (3,2) and proceeds up For the target word wow the output should be: wow starts at (row,col)-(3,2) and proceeds right wow starts at (row,col)(3,4) and proceeds left