Consider a memory of B bytes divided into P pages, where P divides B, that is B = b * P with b integer and power of 2 (b = 2 ^ k for some integer k). Hence, the pages are b = B / P bytes each. The page table of a running process is given by the function p: {1, ..., P} {1, ..., P}. In the following, y div z indicates the integer quotient between y and z, with y mod z the remainder of the integer division between y and z, with y << z the shift to the left of y by z bit and with y >> z the shift a right of y for z bits. What is the formula for translating a generic logical address x into a physical address? Suppose you first have integer and modulo operations available, and then only shift and modulo operations are available.