Given an unordered collection of positive integers by any reasonable input method, return all of the sub-collections that have an odd number of odd elements (i.e. have an odd total).
This is code-golf so you should aim to minimize the byte count of your program.
Since some languages only have ordered collections (lists, arrays, vectors, etc.) or don't have an unordered collection that allows duplicates, you may use ordered collections (regardless of your language choice), however you should not output any duplicate collections with different orders (e.g.
[3,2]). You may output in whatever order you see fit.
[2,3,7,2] -> [,,[2,3],[2,7],[2,2,3],[2,2,7]] [2,4,6,8] ->  [4,9] -> [,[4,9]]