Added Bonus Question start

BQ.c

@@ -0,0 +1,57 @@
+#include <stdio.h>
+// Bonus Question
+// All rows, columns, and diagonals are equal
+
+// Matrix MxM
+// arr[M] sums * 2 + 2
+// Sum of each row, in arr
+int find_row_sum(const int arr[], int len) {
+    int sum = 0;
+    for(int i = 0; i < len; i++) {
+        sum+=arr[i];
+    }
+    return sum;
+}
+// Sum Of each column, in arr
+int find_column_sum(const int arr[3][3],int row, int len) {
+    int sum = 0;
+    for(int i = 0; i < len; i++) {
+        sum += arr[row][i];
+    }
+    return sum;
+}
+// Sum of diagonals, in arr
+int find_diagonal_sum(const int arr[3][3], int len) {
+    int sum = 0;
+    int j = 0;
+    for(int i = 0; i < len; i++) {
+        sum+= arr[i][j];
+        j++;
+    }
+    return sum;
+}
+
+int main() {
+    // Input will be a set matrix for now
+    int M = 3;
+    int square[3][3] = {{8, 1, 6}, {3, 5, 7}, {4,9,2}};
+
+    int sums[2*M + 2];
+    // MAKE THIS SINGLY LINKED LIST LATER
+    for(int i = 0; i < M; i++) {
+        sums[i] = find_row_sum(square[i], M);
+    }
+    for(int i = 0; i < M; i++) {
+        for (int j = M; j < 2 * M; j++) {
+            sums[j] = find_column_sum(square, i, M);
+        }
+    }
+
+    sums[2*M + 1] = find_diagonal_sum(square)
+
+    for(int i = 0; i < sizeof(sums)/sizeof(sums[0]); i++) {
+        printf("%d ", sums[i]);
+    }
+
+    return 0;
+}