Problem:
Question 1- Show that the family of linear languages is not closed under intersection.
Question 2- Write a Java program which finds an approximate solution to an equation f(x) = 0 for some function f. Use the bisection method. To solve the problem using this method first find two values of x, A and B, such that when evaluated in the function f(x) they give opposites signs for the y value.
Show the code, demonstrate it works properly and describe what it is doing.