I NEED HELP WITH JAVA QUESTION. PREVIOUS QUESTIONS WERE NOT ANSWERED. PLEASE HELP. THANK YOU.

Sierpinski triangle question, following the steps & matching w/ the output

StdDraw: https://docs.google.com/document/d/1gecHzFiTE6pSyWcpUh9-7EbTWVXgJDg4w8P09PA6wsQ/edit?usp=sharing

Thank you.

3 QUESTION 1: SiERpINsKI TRIANGLES 3.1 GENERAL DESCRIPTION Write an A5Q1 class containing a main method calling a recursive method to draw Sierpinski triangles (http://en.wikipedia.org/wiki/Sierpinski triangle). Sierpinski triangles are equilateral triangles that can be drawn recursively. You will use the StdDraw class to draw the triangles. 3.2 THE DRAWTrIANGLES METHODS Define two drawTriangles methods, one non-recursive, and one recursive method. The non-recursive version simply calls the recursive version. The recursive version will draw a "level n Sierpinski triangle. A "level 1" triangle is just an ordinary equilateral triangle. A "level n" triangle is made up of three smaller "level n-1" Sierpinski triangles, as defined below