Please solve this correctly or even give me a python code.

Below is the order of memory references made by a processor with $32-$bit memory address.

$4,180,44,4,192,88,65624,88,180,72,18400,18404$

With $16-$word blocks and a direct$-$mapped cache, for each of these memory references, the word address in binary, blockAddress, tag, and setId, whether it is a hit or a miss $($assuming the cache is initially empty$)$ are shown in the table below.

direct$-$mapped m$=10,$k$=4,$n$=1$

hit$/$ miss

wordAddress

qquad blockAddress tag setId $400000000000000000000000000001000000$ miss $18000000000000000000000000010110100202$ miss $4400000000000000000000000000101100000$ hit $400000000000000000000000000001000000$ hit $19200000000000000000000000011000000303$ miss $8800000000000000000000000001011000101$ miss $6562400000000000000010000000001011000102511$ miss $8800000000000000000000000001011000101$ miss $18000000000000000000000000010110100202$ hit $7200000000000000000000000001001000101$ hit $18400000000000000000001000111111000002870287$ miss $18404000000000000000001000111111001002870287$ hit

Redo the table for m$=9$ and n$=2.$