please include details :)

Problem 3. (16 points) Let a positive integer m be the size of a hash table. A hash function h on a non-negative integer key k is defined as h(k)=kmodm, where kmodm is the remainder when k is divided by m. For example, if m=713=91 and k=7251=1757, then h(1757)=1757 mod91=28=74 and 1757/91=19. Show that if m=jp and k=jq for an integer j in the ranges 1