Given n > 3 points P1 = (x1, y1), ..., Pn = (xn, yn) in the Cartesian plane, develop an algorithm to check whether all points are in a triangle with the vertices of the triangle being three points from P1 = (x1, y1), ..., Pn = (xn, yn).

NOTE: For the algorithm's, not looking for full programs. Looking more along the lines of half pseudocode, half coding. See example below of bubblesort.

ALGORITHM BubbleSort(A[0.n 1]) //Sorts a given array by bubble sort //Input: An array A[0.. 1 of orderable elements //Output: Array A[0..n - 1] sorted in ascending order for i 0ton_2do for j 0 to n-2-do