Urgent help with attached question

on last attempt for assignment due in 1 hour, please include answer and briefly show work

For each of the N x / systems A below, what is the rough computational complexity required to solve Ax = b? Choose from among the following options O(N), O(N\\log N), O(N^2), or O(N^3). You may repeat answers, e.g., you could answer O (13) for every A. 2.37 0.89 0.16 -1.50 -0.87 1.21 -1.03 1.28 0.00 2.32 1.37 0.46 -0.47 -1.57 0.79 1.44 0.00 0.00 3.61 -0.25 1.29 -0.28 -0.67 0.55 0.00 0.00 0.00 2.35 0.75 -1.10 0.81 1.21 A1 = 0.00 0.00 0.00 0.00 2.00 -0.82 0.68 -1.89 0.00 0.00 0.00 0.00 0.00 1.94 -0.18 0.45 0.00 0.00 0.00 0.00 0.00 0.00 0.79 -1.49 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.12 [ Select ] 1 A2 = -1 (Hint: A'A = . ..) [ Select ] v -1 -4 1 -1 14 15 -15 -1 1 -4 -15 -4 -7 -14 -1 -4 As = -14 -15 7 -15 -1 -7 -14 -15 1 7 -14 [ Select ]