Q29Multiple correct5 Marks30 Apr 2023

Let L be a n x m matrix of numbers that has already been defined and populated. We wish to find the sum of the elements in each row and store all such row-sums in a list called rowsum. Rows are indexed from 0 to m-1. For the j-th row, rowsum[j] should be the sum of all elements in that row. Select all correct code snippets that achieve this.

A

``` rowsum = [] m = len(L) row, col = 0, 0 while col < m: rowsum.append(0) while row < m: rowsum[col] += L[row][col] row += 1 col += 1 ```

B

``` rowsum = [] m = len(L) row, col = 0, 0 while row < m: rowsum.append(0) while col < m: rowsum[row] += L[col][row] row += 1 col += 1 ```

C

``` rowsum = [] m = len(L) row, col = 0, 0 while row < m: col = 0 rowsum.append(0) while col < m: rowsum[row] += L[row][col] col += 1 row += 1 ```

D

``` rowsum = [] m = len(L) for j in range(m): val = 0 for i in range(len(L[j])): val = val + L[j][i] rowsum.append(val) ```