In terms of D, which is the number of levels of lookahead (or the depth
of the search), which of the following best describes the running time
of the alpha-beta pruning algorithm for most games?

When a subject-oriented search engine groups sites by topic, each group is called a(n) ________

Fill in the blank(s) with correct word

Here is some code. There are only two outputs, one a message from the unnamed namespace the other a message from the Savitch namespace. Tell which line generates which message.

``` #include using namespace std;namespace { void message(); } namespace Savitch { void message(); } int main() { { message(); //a) Savitch::message(); //b) using Savitch::message; message(); //c) } message(); //d) return 0; } namespace Savitch {void message() {cout << "Message from NS Savitch\n";} }namespace {void message(){ cout <<"Message from unnamed NS\n"; ``` 1) List the letters of the lines that give the message from the unnamed namespace: ____________________ 2) List the letters of the lines that give the message from the Savitch namespace: ____________________ What will be an ideal response?