Determining the linear address
Suppose that a memory of size $M$ is divided into blocks of size $B$:


Block 0 consists of cells $0,\ldots,B-1$.
Block 1 consists of cells $B,\ldots,2B-1$.
Block 2 consists of cells $2B,\ldots,3B-1$.
Block $k$ consists of cells $kB,\ldots,(k+1)B-1$.


The "linear address" of a cell is its address in the memory.

Another way of addressing it is by giving which block it belongs to, and what is its offset inside the block. For example, linear address $B+2$ corresponds to block 1, offset 2.

Given a block and an offset, you can easily compute the corresponding linear address; and given the linear address, you can easily compute the block and the offset. Rather than spelling out the arithmetic, I challenge you to come up with the requisite formulas. Using these formulas, you can complete your exercise.