Let G be the following context-free grammar S > Ваа | С А > аЛ|а В БВа | b C dC A|d a) For each variable, derive its CHAIN set. CHAIN(S)-{ CHAIN (A)={ CHAIN(B) { CHAIN(C) { } b) Give a grammar equivalent to G that does not contain chain rules. Follow the construction as discussed in class

Analysis: (Describe the problem including input and output in your own words.) Design: (Describe the major steps for solving the problem.) Coding: (Go over your code step by step)  Testing: (Describe how you test this program).  In other words run your code with sample outputs Analysis of the problem: There is a rectangle with vertices a,b,c,d(let). The position of the vertices are : a=(-5,2.5) b=(-5,-2.5) c=(5,-2.5) d=(5,2.5) The centre of the rectangle is (0,0). Now a point x,y would be given by the user and the program concludes whether the point x,y is within the rectangle or not. The approach of the java code: Take the input of the 2D coordinates from the user. Check whether the horizontal distance is between -5 to 5 and the vertical distance is between -2.5 to 2.5. If the condition is true print the coordinate within the given rectangle. Otherwise print it is not in the rectangle. import java.util.*; class Main{     public static void main(String [] args){         Scanner…