I need help with the following creative thinking exercise, I am given the following scenario and based on it I'm supposed to answer the following questions: 1. How will you keep the atomic weights associated with the abbreviations for the atomic names? 2. What sort of sorting algorithm would you use to search the bonding possibilities? 3. After the new molecules are found, how will you store them to be searchable in a reasonable amount of time? *** Explain why your solution is the best, and explain what BigO() time you can expect because of your choice and why**

Some of the sorting algorithms available to me are: Selection Sort, Merge Sort, Insertion Sort, Heap Sort, Quick Sort (2Way Partitioning and/or 3Way Partitioning)

Some of the means of storing available to me are: Heap (Min. heap and/or Max heap, Binary heap), Stack, Que, Priority Que, Binary Search Tree/Binary Tree, 2-3 Tree and/or Red-Black Binary Search Tree, KD-Tree, Weighted Quick Union Tree, Arrays, ArrayList, Circular Que, Symbol Table, Linked List.

The following tree traversals were also provided as a resource: PreOrder, InOrder, PostOrder, and LevelOrder.

**My thinking** Q1. I was thinking the best way to keep the atomic weights associated with the abbreviations would be to use a SymbolTable. I chose this because a SymbolTable stores items using a Key-Value pair system. Therefore the atomic weights and abbreviations are stored in a manner in which they are kept together. Q2. I'm unsure about which sorting algorithm to use in order to have maximum efficiency with this particular exercise, but I was thinking about QuickSort. I've noticed that on average QuickSort tends to have the most efficient performance overall. My thinking is oversimplified, so please help me open up my thinking/correct my thinking. Q3. I'm a bit confused about what exactly this question is asking, but if I am understanding correctly I think the best way to store the newly found molecules would be to store them in a Binary Tree. The reason behind my thinking is because Binary Trees are formed in a manner of parent-child relationships. Since molecules are being bonded to form new molecules, the molecules that are bonded are the parents of the newly formed molecule which is now the child.

Any help or guidance received, is greatly appreciated. Thanks in advance!

Group 1 2 3 4 5 6 7 8 9 10 12 13 415 16 17 18 78 l9 10 13141 151 161718 4 20 1 22 12324 11 23 26 27 28 2930 131 1323333536 S38 3940 411 421 43 44 145 146 47 48 1495051 52 153 154 51176 1777879 03182 838485 86 7 888189104 105 106 /107 108109 110112 113114115116 117 118 3 1112 K Ca RbSr 6 1 S77 462 58 59 606111 62 63 67 1 68 69 701171 091 92 93 95% | 96-| | 97 | | 98 | | 99 | | 100 1 1 01 | | 102 | | 103 Johnson Biochem Labs Johnson labs has a software that they are developing to better solve chemical problems. The software finds new molecular structures from existing prime elements. It does this by using ordered collections and combining them according to the atomic weights, the number associated with the elements, it will want to find the most bondable elements first. This processes is first then the user then gets a printout with the abbreviations of the elements linked with lines showing the bonds. Once that is done the possible new molecules will need to be searchable in a reasonable amount of time to be reviewed and compared against other combinations