For each of the following grammars state whether it is ambiguous or unambiguous. If it is ambiguous, give an equivalent unambiguous grammar and state all the precedence and the associativity enforced by the unambiguous grammar. If it is unambiguous, state all the precedence and the associativity enforced by the unambiguous grammar. a. E :: = E + F | F
F ::= F* F | Id |(E)

b. E :: = F â© E | F U E | F
F :: = F^ G| F v G |G
G:: = Id | (E)

Write a method that takes in an array of point2d objects, and then analyzes the dataset to find points that are close together. be sure to review the point2d api. in your method, if the distance between any pair of points is less than 10, display the distance and the (x,y)s of each point. for example, "the distance between (3,5) and (8,9) is 6.40312." the complete api for the point2d adt may be viewed at ~pf/sedgewick-wayne/algs4/documentation/point2d.html (links to an external site.)links to an external site.. try to write your program directly from the api - do not review the adt's source code.