If Grammar is unambiguous, it must be LL(1) - False
For a given grammar to be not LL(1), there may be various reasons, like the grammar may be left recursive or left factored or the LL(1) parsing table has multiple entries.
If not LL(1) it does not mean ambiguous. - True
As specified above the various reasons for a grammar to not be LL(1), if the grammar is not LL(1), it may or may not be ambiguous.
The given grammar is not ambiguous. It is left recursive and hence not LL(1).