Please Show all work and steps!

Problem statement: a. Differentiate between linear and non-lincar data structures. Is BST a linear or non-linear data structure? What is the fundamental characteristic of a binary search tree? b. Consider the following BST. 30 15 60 7 22 45 75 17 27 Insert the following items into this BST and then write down the post-order traversal of the tree. i. 23, 55,40 Then, insert the following elements into the resultant tree and then write down the pre-order traversal of the tree. ii. 90, 0, 20