Recursion for Sierpinski Triangle

This function draws Sierpinski triangle by using recursion

RST.m: Recursion for Sierpinski Triangle
Description: This function draws Sierpinski triangle by using recursion
Input: 3 coordinates A, B, C (2-D vector) and number of recursion 'n'

Example: A(2,4), B(0,0), C(4,0), n = 5 --> RST(A, B, C, n)

Output: Graph of Sierpinski Triangle

Complexity: O(3^n)

---------------------------------------------
main.m: Example for using RST.m