T10-HW10.2. Averaging Neighboring Values Assume v is a vector in R5. You wish to compute a vector w such that the ith entry of w, denoted Wi, is the average of Vi-1, Vi, Vi+1, Vi+2. For example, wi is the average of vo, V1, V2, V3. For elements at the endpoints of w, you will account for all available elements in your average. For example, wo (assuming zero-based indexing) is the average of vo, V1, V2. Construct a matrix A such that Av = w. Fill in the entries of A below. A = If A is stored in sparse COO format, with 64-bit floats used for the data and 32-bit integers for the indices, how many bytes does it takes to store A? num_bytes = integer T10-HW10.2. Averaging Neighboring Values Assume v is a vector in R5. You wish to compute a vector w such that the ith entry of w, denoted Wi, is the average of Vi-1, Vi, Vi+1, Vi+2. For example, wi is the average of vo, V1, V2, V3. For elements at the endpoints of w, you will account for all available elements in your average. For example, wo (assuming zero-based indexing) is the average of vo, V1, V2. Construct a matrix A such that Av = w. Fill in the entries of A below. A = If A is stored in sparse COO format, with 64-bit floats used for the data and 32-bit integers for the indices, how many bytes does it takes to store A? num_bytes = integer