Answer
$4096$
Work Step by Step
Each node is connected to 4 other nodes so the number of nodes at nth level will be $4^{n}$. The number of paths checked will be the number of nodes at 6th level which will be $4^{6} = 4096$.
Invitation to Computer Science 8th Edition
by Gersting, Judith L.; Schneider, G. Michael
Published by
Cengage Learning
ISBN 10:
1337561916
ISBN 13:
978-1-33756-191-4
Chapter 3 - Exercises - Page 146: 35b
Update this answer!
You can help us out by revising, improving and updating this answer.
Update this answerAfter you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.
