49 Q0verride 50 public String toString() \{ 51 StringBuilder sb = new StringBuilder ( ); 52 for (DoubleLinearNode _T> current =head; current !=null; current = current.getNext()) \{ 53 sb.append(current.getItem()).append(' '); 54} 55 return sb.toString(); 56} Hence this is the required answer please upvote me Explanation Hence this is the required answer please upvote me Step 2/2 Hence this is the required answer please upvote me In a separate document (typically just under one page single spaced), discuss your choice of data structure using the two prompts below. Your discussion must use your knowledge of: 1) data structure behavior, 2) the problem scenario, and 3) basics algorithm analysis. For example, you should find how data is accessed (read or written) in the scenario, then discuss how your selected data structure would support that style of access, and then strengthen your argument by describing the data structure's performance using Big-Oh. Do not give answers which are independent of the scenario. - Justification: why did you selected the particular data structure for your implementation? Start by indicating the design you selected. [3 points] - Downsides: what would be a potential future usage scenario where your choice of data structure would be problematic? Provide such a scenario. [3 points] Note that are multiple approaches to these prompts: performance is the most straightforward way, but space usage and maintainability are also important aspects that can be considered