The data structure required for Breadth First Traversal on a graph is

• A. queue
• B. stack
• C. array
• D. tree