![(3) [6pts] Let S be the subset of the set of ordered pairs of integers defined recursively by: Initialization Step: (0,0) eS Recursion Step: If (a, b) e S, then (a + 2, b +3) e S, and (a+3, b+2) eS Answer the following questions: [4pts] List the elements of S obtained by applying the recursive definition first 4 times. Show all your work. [2pts] Does (1, 1) belong to S? Does (3, 4) belong to S? 1. 2.](https://media.cheggcdn.com/media%2Fa33%2Fa33ba870-1526-434c-a3fe-64ad8871f461%2Fphp2m8lPk.png)
(3) [6pts] Let S be the subset of the set of ordered pairs of integers defined recursively by:
PayPal Gateway not configured
PayPal Gateway not configured
![(3) [6pts] Let S be the subset of the set of ordered pairs of integers defined recursively by: Initialization Step: (0,0) eS Recursion Step: If (a, b) e S, then (a + 2, b +3) e S, and (a+3, b+2) eS Answer the following questions: [4pts] List the elements of S obtained by applying the recursive definition first 4 times. Show all your work. [2pts] Does (1, 1) belong to S? Does (3, 4) belong to S? 1. 2.](https://media.cheggcdn.com/media%2Fa33%2Fa33ba870-1526-434c-a3fe-64ad8871f461%2Fphp2m8lPk.png)
(3) [6pts] Let S be the subset of the set of ordered pairs of integers defined recursively by:
PayPal Gateway not configured
PayPal Gateway not configured