In this task you will be given a text passage from a trivia quiz. You should choose the category this question belongs to from these categories: History, Science, Social Science, Fine Arts, Literature. You can only choose one category, so if in doubt, please choose the closest match.

Q: This poet wrote The firefly wakens; waken thou with me in his poem Now Sleeps the Crimson Petal. The title objects of one poem are described as Fresh as the first beam glittering on a sail / That brings our friends up from the underworld, and another poem starts with the line the wood decays, and woods decay and fall. In addition to Tears, Idle Tears and Tithonus, the title character of one poem comments much have I seen ands knowncities of men and later declares he needs to strive, to seek to, and not to yield. and another poem includes the assertion Theirs not to reason why / Theirs but to do and die. For 10 points, name this Victorian poet who wrote Ulysses and The Charge of the Light Brigade.

A: Literature
****
Q: This philosopher argued for a hybrid approach of historical materialism and psychoanalysis that he termed the "progressive-regressive method." He used the example of a man that fails to meet his friend after walking into a cafe to illustrate the second title concept of one of his works. This man densely analyzed the life of Gustave Flaubert in his book length study The Family Idiot. His short treatise (*) Search for a Method recapitulates themes of another of his books, which calls humanity a "fused group." This author of Critique of Dialectical Reason argued that the object of consciousness exists as "in-itself," but experience exists "for itself" in a book that argues the authentic life is one way to escape the grip of "bad faith." For 10 points, name this existentialist author of Being and Nothingness.

A: Social Science
****
Q: The Fibonacci type can notably perform many common operations with almost constant amortized cost, and they are often used to implement priority queues. Key to executing many graph algorithms, such as Dijkstras, they are often implemented in arrays with adjacent elements being widely separated by index. Its namesake sort has complexity bound of order n log n, and its nodes usually satisfy the property that the children are either consistently lesser or greater than their parents. For 10 points, name this tree-based data structure.

A:
Science
****