A $Left Linear$ grammar is a grammar which has at most one non-terminal on right side and is left recursive.
Now considering the set of strings generated by the given grammar:
$ \{ abbabb,abbaababb,.....\} $
By carefully observing the pattern , we notice that the strings always begin with $ab$ and end with $babb$. Using this information We can easily arrive at the grammar:
$S \rightarrow Ababb$
$A \rightarrow ab|Abaa$