Problem $($Recursion and Algorithms$)$: Let M be a set defined as follows:

$1$ belongs to M$,$ i$.$c$.,1$ is an element of the set M$.$

$-$If $1$ belongs to M$,$ then both $2\backslash$deg $4+1$ and $3*$t$+1$ belong to M$.$

$1.$ Give the first $19$ elements of M in an ascending order, where I is the first clement of M$.$

$2.$ Think about an algorithm that computes the first $99$ elements of M in an ascending order.