I NEED THIS IN RACKET PROGRAMMING IF IT IS NOT IN THAT I WILL DOWNVOTE AND REPORT YOUR ACCOUNT CHEGG AUTHORITY I WANT ANSWER WITH FULL EXPLANATION OTHERWISE I WILL REPORT IT

; a) Define a procedure (subsets x) that takes a list as a single argument

; and returns all 2^n subsets of that list, i.e. the power set of the list;

; e.g. (subsets '(a b c)) ==> (() (c) (b) (b c) (a) (a c) (a b) (a b c))

; The order of the subsets returned is not important.