I really need some assistance! I've created a program for a list based stack, but I continue to receive error message "Stack" has no attribute "list". If anyone could guide me in the right direction, that would be great!

Design and implement an experiment that will compare the performance of the Python list$-$based stack and queue with the linked list implementation. Provide a brief discussion of both stacks and queues for this activity.

#implementating a stack with linked list

import gc

gc$.$collect$()$

class Node:

def initial$($self$,$new$\_$data$)$:

self.data $=$ new$\_$data

self.next $=$ None

class Stack:

#set head as null by default

def initial$($self$)$:

self.head $=$ None

# Checks if stack is empty

def isempty$($self$)$:

if self.head $==$ None:

return True

else:

return False

#adding data to the stack

def push$($self$,$new$\_$data$)$:

if self.head $==$ None:

self.head $=$ Node$($new$\_$data$)$

else:

new$\_$node $=$ Node$($new$\_$data$)$

new$\_$node.next $=$ self.head

self.head $=$ new$\_$node

#removes current head from the stack

def pop$($self$)$:

if self.isempty:

return None

else:

pop$\_$item $=$ self.list.head.data

self.list.remove$\_$head$($None$)$

return pop$\_$item

num$\_$stack $=$ Stack$()$

num$\_$stack.push$(40)$

num$\_$stack.push$(74)$

num$\_$stack.push$(25)$

num$\_$stack.push$(37)$

print$("$Element stack after push is:$",$ end$=\text{'}\text{'})$

listedNode $=$ num$\_$stack.list.head

while listedNode $!=$ None:

print$($listedNode$.$data, end$=\text{'}\text{'})$

listedNode $=$ listedNode.next

print$()$

pop$\_$item $=$ num$\_$stack.pop$()$

print$("$Popped element:", pop$\_$item$)$

print$("$Elements stack after pop is:$",$ end$=\text{'}\text{'})$

listedNode $=$ num$\_$stack.list.head

while listedNode $!=$ None:

print$($listedNode$.$data, end$=\text{'}\text{'})$

listedNode $=$ listedNode.next

print$(\text{'}$

$\text{'})$