The answer is B. The program prints:
2
Why?
count goes through the string and counts how many times ‘o’ appears.
Trace table
A trace table follows the program step by step. Here’s this one:
| letter | matches? |
|---|---|
| b | |
| e | |
| e | |
| p | |
| (space) | |
| b | |
| o | yes |
| o | yes |
| p |
The code again
word = "beep boop"
print(word.count("o"))Try it: change one number in the program and predict the new output before you run it.