Help me do my washing Help! My Completely Automated Lights From Darks Separator V3001.01 broke! :(
Guidelines

Task
Write a program that will take an input of an array (or a list in some languages) of any amount of strings that are either the letter L or the letter  D (representing lights or darks) and output an array that contains two arrays, one with all the L's, and one with all the D's.

Rules

It's code golf so the shortest answer in bytes wins
Input will only ever contain capitals
There must be the same number of L's in the output as there is in the input, same goes for the D's
The input may only have one element (or maybe even zero elements)
If one or both of the output arrays contain no elements, output an empty list (in some languages this may mean you need to output a string)
Always have the first array be the array of L's


Example output:
[&quot;L&quot;,&quot;D&quot;,&quot;L&quot;,&quot;D&quot;,&quot;D&quot;] -&gt; [[&quot;L&quot;,&quot;L&quot;],[&quot;D&quot;,&quot;D&quot;,&quot;D&quot;]]
[&quot;L&quot;,&quot;L&quot;,&quot;L&quot;] -&gt; [[&quot;L&quot;,&quot;L&quot;,&quot;L&quot;],[]]
[&quot;D&quot;,&quot;D&quot;] -&gt; [[],[&quot;D&quot;,&quot;D&quot;]]
[] -&gt; [[],[]]
Python 3, 37 bytes



lambda a:[[c]*a.count(c)for c in"LD"]


Try it online!