Figure out if this is LL(1) grammar

S → ( T )

T → U | U , T

U → x | S

I got these two questions?

(b) Is the grammar LL (1)? (c) Is the language LL (1)?

I don’t know exactly how to figure this out? They say that you should look left recursion in this grammar? But i’cant figure out this thing?