discrete math proof

10 pts Assume S is a recursively defined set, defined by the following properties: 2ES n,me S - nmeS nES - n5 ES Use structural induction to prove that all members of S are powers of 2 (with the exponent being a positive integer). In your response, write "power of 2" instead of "power of 2 with positive integer exponent" for brevity. Your proof must be concise