Question: Binary List Combinations of Length 3

I need to find all combinations of a binary list of length 3.  For example: [0,0,0] , [1,0,0] , [0,1,0] , [0,0,1] , [1,1,0] , [1,0,1] , [0,1,1], [1,1,1].  Does anyone have a procedure or can write a loop that does this?

Please Wait...