Let the language be $L1= \left \{ 0^{N}1^{N} | N\geq 0 \right \}$
For this language, we can design a context free grammar as
$A\rightarrow \epsilon /0A1$
Now, according to the question, $L= L1$*
We can write grammar for this as
$S\rightarrow \epsilon /AS$
$A\rightarrow \epsilon /0A1$
This grammar generates $\epsilon , A,AA,AAA,AAAA,AAAAA,.................................$
Now, Is this language DCFL or NCFL ?
We can try to make a DPDA for it. If it exists,,then this language is DCFL.
This language L is DCFL and as well as NCFL.