function  = sierpinski(v1, v2, v3, n) The input variable n is the number of times to run the algorithm and the vertices v1, v2, and v3,ideally define an equilateral triangle. The algorithm for the construction of a Sierpinski triangle is given by: (a) Define the three vertices of the triangle, e.g. v1 = [0 0], v2=[1 0] ; v3 = [0.5 sqrt(3)/2]. (b) Select any one of the corner points (vertices) as the starting point, making it your “currentposition” (e.g. current_pos = [0, 0]). (c) Randomly select one of the three provided vertices, v1, v2 or v3. (d) Move half the distance from your current position to the selected vertex and make this your newcurrent position. I.e. compute the average of (currentPos + selectedVertex)/2 and make this your new currentPos. (e) Plot the new current position. (f) Repeat from step c for n times.