G A = {hR, Si : R, S are regular expressions such that L(R) ⊆ L(S)}. Present a proof to show that A is decidable. You may find the proof of Theorem 4.5 instructive when presenting your proof to this problem.

Four equations are shown below.equation 1: y=2*equation 2: y=2x-5equation 3: y=x2 + 6equation 4: tdentify one linear equation and one nonlinear equation from the list.why each equation you identified is linear or nonlinear.nd one nonlinear equation from the list. state a reasonlinear equation