Write a C program to simulate thread scheduling that ensures deadlock avoidance using a simplified resource allocation system. The goal is to avoid deadlock by controlling the order in which threads acquire locks, based on a predefined global knowledge of resources.

Design:

$$ You should create $3$ threads $($T$1,$ T$2,$ T$3),$ and each thread needs to acquire $2$ locks $($Lock A and Lock B$)$ in a specific order.

$$ The threads should not be able to acquire locks in a fashion such that the program deadlocks.

$$ The program should ensure deadlock$-$free execution by scheduling the acquisition of locks based on the given deadlock avoidance algorithm.

$$ Implement deadlock avoidance using Resource Instance Ordering as follows:

$$ Enforce a strict lock acquisition order $($e$.$g$.,$ Lock A must always be acquired before Lock B$).$

$1.$ Input:

$$ None

$2.$ Output:

$$ Print messages showing the order of lock acquisition and thread waiting $($e$.$g$.,"$T$1$ acquired Lock A$","$T$2$ waiting for Lock A$").$

$$ The program should terminate after each thread has acquired each lock $3$ times.