Question: 
Write a function to find the largest triangle that can be inscribed in an ellipse.


Model's Code:
def largest_triangle(a, b):
    from math import pi
    return (a * b * pi) / 2



Sample Correct Code:
import math
def largest_triangle(a,b): 
    if (a < 0 or b < 0): 
        return -1 
    area = (3 * math.sqrt(3) * pow(a, 2)) / (4 * b);  
    return area 


Asserts:
assert largest_triangle(4,2)==10.392304845413264
assert largest_triangle(5,7)==4.639421805988064
assert largest_triangle(9,1)==105.2220865598093


Tests:
Test 1 of 3: FAIL: AssertionError()

Test 198 of 974: 145/198 (73.23232323232324%): failed