Assume v is a vector in IR6. You wish to compute a vector w such that the ith entry of w, denoted w, is the average of vi-2, Vi-l, Vi.For example, v2 is the average of vo. 2 For elements at the endpoints of w, you will account for all available elements in your average. For example, vo (assuming zero-based indexing) is the average of vo 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_ bytesinteger Assume v is a vector in IR6. You wish to compute a vector w such that the ith entry of w, denoted w, is the average of vi-2, Vi-l, Vi.For example, v2 is the average of vo. 2 For elements at the endpoints of w, you will account for all available elements in your average. For example, vo (assuming zero-based indexing) is the average of vo 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_ bytesinteger