please solve the problem (1) Creating $3 \times 3$ Inverse Matrix using QTSPIM (2) Creating Heap Sort nsing QTSPIM (The number entered is added as the last node of the heap and immediately sorts in...

Extracted text: please solve the problem (1) Creating $3 \times 3$ Inverse Matrix using QTSPIM (2) Creating Heap Sort nsing QTSPIM (The number entered is added as the last node of the heap and immediately sorts in descending order with heip sort and prints it out) - I made some algorithms, but I had difficulty because Ididn't know the cyntax of QTSPIM Please contuct me to refer to what I made. cs.vs. 1244