Could a LL$($k$)$ parser $($like the one in lecture$)$ parse this?

S $$ SAB$|$ SBA $|$ B $|$ A A $$ Aa $|$ a B $$ Bb $|$ b

Choice $1$ of $4$:Yes, because this is a right recursive grammarChoice $2$ of $4$:Yes, because this is a left recursive grammarChoice $3$ of $4$:No$,$ because if we read and parse left to right, we get an example of an infinite loopChoice $4$ of $4$:None of the above