Please write the answer in pseudocode.

(c) (i) A pointer start points to the first element of a singly-linked list L. Write an algorithm that inserts a new node (with data field val ) at the beginning of the linked list L and returns start. What is the worst-case running time of your algorithm? (ii) A priority queue is implemented using an array. Items stored in the array are ordered by the values of their keys in non-decreasing order. Write an algorithm to insert a new item with a specified key into the array