Practice question. It is required to program an operation: ```java ListIF<TaskIF> getTasksBetweenDates(int dI, int dF) ``` that returns the list of tasks to be performed between dates dI and dF, both included, specified by the parameters and stored in the future task scheduler. As a precondition, assume that dI < dF. a) (1 point) Implement getTaskBetweenDates(dI, dF) so that it is independent of the structure chosen to implement the task scheduler. b) (1 point) Compute the worst-case asymptotic time cost of getTaskBetweenDates(dI, dF).

Analyze the following code fragments and determine their worst-case asymptotic time cost: a) (1.5 points) ```java int i = 1; while (i < n) { System.out.println(i); i *= 2; } ``` b) (1.5 points) ```java public static int dum(int n) { if (n == 0) { return 0; } else if (n <= 3) { return 1; } else { return dum(n-1) + dum(n-2) + dum(n-3); } } ```

Suppose a turn-based game with several players whose number can decrease during the game when someone is eliminated during their turn. Each player performs an action and then passes the turn to the next player, in circular order. You are asked to program a Data Type that lets us manage the order in which players take their turns. For this, two operations are needed: - pasarTurno(): advances the turn to the next player. - eliminarJugador(): removes the current player from the game. a) (0.5 points) Indicate which data structure studied in the course would be the most appropriate, so that the cost of both operations is optimized. Also indicate how the current player can be identified in that structure. b) (1.5 points) Implement pasarTurno() and eliminarJugador().

Given the following tree, indicate the sequence of nodes visited by preorder, postorder, and breadth-first traversals (from left to right). 1 / | \n 2 3 4 / \ | 5 6 7 Explain how each traversal is performed.