Goals This assignment extends your work on hw06 with linked lists, but also includes an extra focus on algorithmic complexity. The goals are as follows: Learn how to keep data separate from containers Practice designing algorithms and data structures Practice using code that uses the following: linked lists structures for data encapsulation dynamic memory (i.e., malloc) struct initializer syntax (C99) Learn how analyze the complexity of algorithms