M Q20. Picture the implementation of a singly-linked list Slist data structure. Imagine it based on a struct SNode that has only two data members: T value; and SNode* next. What is true when it comes to trying to implement an insert function SList::insert(iterator itr, T x)? (a) This not be possible, because a new sNode with value x cannot be properly linked up to an SNode referenced by iterator itr at some arbitrary position in the list. This is because the back- pointers SNode* prev are missing. (b) This can be done by using the same operations as the ones to insert into the double-linked List that we have studied. The computational cost will be the same. (c) This can be done, but the computational cost will be higher than the cost for inserting a new value into a doubly-linked List. (d) This can be done and it will be computationally cheaper than inserting into a doubly-linked List. There are some savings because no back-pointers (e.g., SNode* prev) need to be adjusted. TAKE-HOME MIDTERM EXAM PORTION Consult Blackboard after 4:30 pm today, for a take-home midterm exam portion under the "Midterm" content area on Bb. Follow all instructions listed there. The midterm solutions are due on Thursday, Feb 13 2020 by 11:59pm. This deadline is firm!! There will be an open portal in the "Midterm" content area. Submit a pdf scan or photo; the submission must be readable. M Q20. Picture the implementation of a singly-linked list Slist data structure. Imagine it based on a struct SNode that has only two data members: T value; and SNode* next. What is true when it comes to trying to implement an insert function SList::insert(iterator itr, T x)? (a) This not be possible, because a new sNode with value x cannot be properly linked up to an SNode referenced by iterator itr at some arbitrary position in the list. This is because the back- pointers SNode* prev are missing. (b) This can be done by using the same operations as the ones to insert into the double-linked List that we have studied. The computational cost will be the same. (c) This can be done, but the computational cost will be higher than the cost for inserting a new value into a doubly-linked List. (d) This can be done and it will be computationally cheaper than inserting into a doubly-linked List. There are some savings because no back-pointers (e.g., SNode* prev) need to be adjusted. TAKE-HOME MIDTERM EXAM PORTION Consult Blackboard after 4:30 pm today, for a take-home midterm exam portion under the "Midterm" content area on Bb. Follow all instructions listed there. The midterm solutions are due on Thursday, Feb 13 2020 by 11:59pm. This deadline is firm!! There will be an open portal in the "Midterm" content area. Submit a pdf scan or photo; the submission must be readable