Write pseudocode (that is, a programming structure understandable from English words and mathematics alone) for an algorithm which applies naive Gauss elimination to solve for the n x1 column vector {X} satisfying [A]{X} = {B}, where [A] is a given nxn matrix, and {B} is a given n x1 vector. Design your pseudocode to quit if it is detected that the determinant of [A] is zero. Extra comments in the code are encouraged but not required for full points. REMARKS: Note that by "naive" Gauss elimination, we mean Gauss elimination that does NOT include partial pivoting. Also, we are NOT asking you to write a simple condition in your code of the form "If det([A]) = 0), quit. Instead, find a way to write your Gauss elimination code that checks for this condition