In C language, give a solution to dining philosophers problem using busy waiting loop (without semaphores). Prompt user for number of philosophers, then number of meals. Then follow the algorithm:

1. Sit down at table.
2. Pick up left chopstick.
3. Pick up right chopstick.
4. Begin eating.
5. Continue eating for 2-7 cycles.
6. Put down left chopstick.
7. Put down right chopstick.
8. Begin thinking.
9. Continue thinking for 2-7 cycles.
10. IF all meals have not been eaten, GOTO 2.
11. ELSE leave the table.