Given the grammar:
$S \to AS\mid \varepsilon$
$A \to A1\mid 0A1 \mid \varepsilon$
Generate a new unambiguous grammar that generates the same language as the grammar above.
I have no idea how to make it unambiguous, I have proven already that the given language has two leftmost derivations for the string 01101.