837 -> 172 -> 135 -> 751 -> 474Where 443 is the 'front' of the queue, 474 is the 'back', and the 'count' is 6.What would the psuedocode for dequeueing an element look like?O 1. Create a new...

Extracted text: A Queue that has been implemented with a singly-linked list has the following structure: 443 -> 837 -> 172 -> 135 -> 751 -> 474 Where 443 is the 'front' of the queue, 474 is the 'back', and the 'count' is 6. What would the psuedocode for dequeueing an element look like? O 1. Create a new singly-linked node called temp 2. Set temp to the front's element pointer 3. Set the front pointer to the current front's next pointer 4. Decrement count 5. Return temp 1. Create a new Integer called temp 2. Set temp to the back's element pointer 3. Set the back pointer to the null 4. Decrement count 5. Return temp 1. Create a new singly-linked node called temp 2. Set temp to be the same as the front pointer 3. Set the front pointer to the current front's next pointer 4. Decrement count 5. Return temp 1. Create a new Integer called temp 2. Set temp to the front's element pointer 3. Set the front's next pointer to null 4. Set the front pointer to the current front's next pointer 5. Decrement count 6. Return temp O 1. Create a new Integer called temp 2. Set temp to the front's element pointer 3. Set the front's next pointer to null 4. Decrement count 5. Return temp