Given the following relational database schema related to the $$Squid Game$$ TV show:

PLAYERS $($PlayerID$,$ Name, Age, Gender$)$

GAMES $($GameID$,$ GameName, DifficultyLevel$)$

PLAYER$\_$PERFORMANCE $($PlayerID$,$ GameID, Score, Status$)$

Suppose that the PLAYERS table has $3500$ records stored in $53$ disk blocks and the following access

paths:

$$ A primary index on PlayerID, with levels xPlayerID $=3.$

$$ A clustering index on Gender, with levels xGender $=1.$ There are a total of $3$ distinct values for

Gender.

$$ A bitmap index on Age that is stored in $2$ disk blocks. There are a total of $24$ distinct values for

Age.

For each of the following selection operations, compute the cost of performing the operation using the

brute force approach and the available indices. Justify which method is more cost$-$effective for each

operation.

$$ OP$1$:

sPlayerID $=007($PLAYERS$)[5$ points$]$

$$ OP$2$:

sGender $!=$Female$($PLAYERS $[5$ points$]$

$$ OP$3$:

sGender $=$Female$$ AND Age IN $(20,30,40)($PLAYERS$)[5$ points$]$