Please answer these questions asap and here an answer for question 1 because its related to question 2

2. Consider the above relation again, but with your computer \& Java. a) Write a method (e.g. recurRelation ()) which takes two arguments, for c and an1, and returns an. (1 mark) b) Call the method from main repeatedly (If you want a1,a10, call it 10 times). Set c and a0 to preferred values, as examined in Question 1.d). Values of an will be stored in a single-dimensional array. (2 marks) c) Write the array together with array indices into a csv file (col. 1: n, col. 2: an ). (3 marks) d) Create the line graph of it (e.g. using Excel). (1 mark) e) Create more graphs to support your answer to Question 1.d), by changing the values of c and a0. (3 marks) 3. This question asks you to add the term can12 to the right-hand side of the above linear recurrence relation. Examine how this additional term affects the motion of a0,a1,a2,, by modifying your method (recurRelation ()), setting c and a0 to some values, running your program, and creating graphs. You may modify your main method so it best fits what you want to do. (a)an00=can1=can1=cn/characteristicseqr (b) general eqn: an=cnk (c)na0kanan=0=c0k=a0/c0(substitutek=cn(a0/c0)=a0cn0 Ifc=2a0a1a2a3anda0=1,=1=21=2=22=4=24=8