The proposal report should include 1.Introduction 2.Background 2.1 Information about question 2.2 Literature review 3.Problem being solved 4.Objectives 5.Discussion of solution 6.Limitation 7.Conclusion 8.References Also make a PowerPoint presentation of this proposal. Note:please follow instructions and make two pages for each heading 4. Santa Claus sleeps in his shop up at the North Pole, and cai only be wakened by either all nine reindeer being back from their year long vacation on the beaches of some tropical island in the South Pacific, or by some elves who are haviug some difficulties making the toys. Onc clis problem is never serious enough to wake up Santa (Otherwise, he may never get any sleep), so. the elves visits Santa in a group of three. When three elves are having their problems solved, any other elves wi sing to visit Santa must wait for those elves to refurn. If Santa wakes up to find three dves waiting at his shops door, along with the last reindeer having come back from the tropics, Santa has decided that the elves can wait until after Christmas, because it is more important to etet his sleigh ready as suon as possible. (H is assumed that the reindeer dont want to leave the tropics, and therefor they stay there until the last possible moment. They might not even come back, but since Santa is footing the bill for their year in paradise this could also explain the quickness in their delivering of presents, since the reindeer ean't wait to get bach to where it is warm.) The penalty for the last reindeer to arrive is that it must get Santa while the othens wait in a warming hut before being harnessed to the sleigh Here are some addition specifications: - After the ninth reindeer arrives, Santa must invoke prepareSleigh, and then all nine reindeer must invoke getllitwed. - After the third elf arrives, Santa must invoke helplives. Concurrently, all three elves should invoke getHelp. - All three clves must invoke getHelp belore any ad sitional clves enter (increment the elf counter). Santa should run in a loop so he can help many sets of elves. We cail assume that there are exactly 9 reindeer, but there may be any number of elves. Message ordering: ensuring that events happen in order at the right time. Priority: ensuring that the group of Reindeer have prionty over any EIf groups that may be waiting at the time. Self-Organization: Santa cannot marshal a group of Elves or Reindeer, thise groups must organize among themselves without help from a Santa thread or process. Synchronization: synchronization between various processes. The usual freedom from deadlock, livelock, and starvation. Implement this using a programming language of your choice using semaphores. You are required to do the following tasks in a uroup of two (2); a) Submit a written report on your proposcd solution detailing low the solution was arrived at b) Submit a rumning program c) Do a 5 minufe presentation on your solution. .

1. The proposal report should include
1.Introduction
2.Background
2.1 Information about question
2.2 Literature review
3.Problem being solved
4.Objectives
5.Discussion of solution
6.Limitation
7.Conclusion
8.References
Also make a PowerPoint presentation of this proposal.
Note:please follow instructions and make two pages for each heading
4.
Santa Claus sleeps in his shop up at the North Pole, and cai only be wakened by either all nine
reindeer being back from their year long vacation on the beaches of some tropical island in the
South Pacific, or by some elves who are haviug some difficulties making the toys. Onc clis
problem is never serious enough to wake up Santa (Otherwise, he may never get any sleep), so.
the elves visits Santa in a group of three. When three elves are having their problems solved, any
other elves wi sing to visit Santa must wait for those elves to refurn. If Santa wakes up to find
three dves waiting at his shops door, along with the last reindeer having come back from the
tropics, Santa has decided that the elves can wait until after Christmas, because it is more
important to etet his sleigh ready as suon as possible. (H is assumed that the reindeer dont want
to leave the tropics, and therefor they stay there until the last possible moment. They might not
even come back, but since Santa is footing the bill for their year in paradise this could also
explain the quickness in their delivering of presents, since the reindeer ean't wait to get bach to
where it is warm.) The penalty for the last reindeer to arrive is that it must get Santa while the
othens wait in a warming hut before being harnessed to the sleigh Here are some addition
specifications: - After the ninth reindeer arrives, Santa must invoke prepareSleigh, and then all
nine reindeer must invoke getllitwed. - After the third elf arrives, Santa must invoke helplives.
Concurrently, all three elves should invoke getHelp. - All three clves must invoke getHelp belore
any ad sitional clves enter (increment the elf counter). Santa should run in a loop so he can help
many sets of elves. We cail assume that there are exactly 9 reindeer, but there may be any
number of elves. Message ordering: ensuring that events happen in order at the right time.
Priority: ensuring that the group of Reindeer have prionty over any EIf groups that may be
waiting at the time. Self-Organization: Santa cannot marshal a group of Elves or Reindeer, thise
groups must organize among themselves without help from a Santa thread or process.
Synchronization: synchronization between various processes. The usual freedom from deadlock,
livelock, and starvation. Implement this using a programming language of your choice using
semaphores. You are required to do the following tasks in a uroup of two (2); a) Submit a written
report on your proposcd solution detailing low the solution was arrived at b) Submit a rumning
program c) Do a 5 minufe presentation on your solution.