$14.$ In a demand paging system, let's say that processes P$1$ and P$2$ each have logical memory addresses from $0$ to $99$ and the page size is $5.$ In the hash table used in the data structure, a hash function is used to simply obtain the index by adding the process ID and logical page number. $($Not a good hash function.$)$ The hash table and the inverted page table are as follows. The arrows in the hash table point to the chain when the hash collides, and each entry in the inverted page table points to an unallocated physical page frame.

Calculate the physical address of the following logical address, where the number after the colon is a logical address $($not a logical page$).$ The ID of the first page of the process is $\backslash (0$: $\backslash )$ P$1$:$17.$ P$1$:$92.$ P$1$:$111$

$(1)$ Calculate the number of calculations required to obtain the physical address from each logical address and $(2)$ the number of table lookups. $[3$ points$]$