1. When dealing with large dense symmetric matrix it is recommended that to either store upper right or lower left entries only to avoid redundancy and thereby saving a lot of space (particularly when the matrix elements are of double type or any other user-defined datatype). Let us assume that we have decided to store only the upper right entries of a matrix inside an 1D array in row-major arrangement. 1. Design an algorithm for accepting a symmetric matrix from the user and printing the same matrix. 2. Design an algorithm for multiplying a given symmetric matrix stored in 1D array with a compatible vector. 2. A doubly ended queue operation) is a data structure consisting of a list of items on which the following operations are possible: deque (Not to be confused with dequeue AddFront(x): Insert item x on the front end of the deque. DelFront(): Remove the front item from the deque and return it. AddLast(x): Insert item x on the rear end of the deque. DelLast(): Remove the rear item from the deque and return it. Write routines to support the deque operations.