<p><img alt="An Epic Battle In this project we will simluate an epic battle between a hero and some monsters. We will use structs to store" src="https://media.cheggcdn.com/media%2F073%2F073b1344-11d4-439d-835b-bbbe0e8d80f1%2FphpqSMh8x.png" style="height:729px;width:736px;" aria-describedby="d3f"/><img alt="Functions Use
<h3>Question Description</h3> <p>The answer should be based on close work with the texts assigned before the prompt, rather than your own personal opinions. Substantiate your answers with specific references to
<p><img alt="a. (2 marks) Recall briefly the notions of Las-Vegas and Monte-Carlo algorithms b. (2 marks) Describe Las-Vegas and Monte-Carlo versions of QuickSort having worst-case com- plexity O(n logn). c.