$(15$ points$)($Concepts$)$ Answer TRUE$($T$)$ or FALSE$($F$)$ for each of the following questions. Briefly explain your answers. If your answer to a question is FALSE, provide the correct answer.

$\backslash$table$[[\backslash$table$[[$Question$],[$The SELECT clause of$],[$SQL is equivalent to the$],[$selection operator $(\backslash$sigma $)$ of$],[$relational algebra.$]],\backslash$bar $($T$)/$F$,$Explanation$/$Correction$],[,],[\backslash$table$[[\backslash$table$[[$Normalization is$],[$usually performed$],[$during the conceptual$],[$design phase.$]]]],,],[\backslash$table$[[$If a decomposition is$],[$lossless join, it must$],[$also be dependency$],[$preserving$.]],,],[\backslash$table$[[$It is possible for a$],[$schema to be in BCNF$],[$but not in $3$NF$.]],,],[\backslash$table$[[\backslash$table$[[$On a multi$-$core or$],[$multi$-$CPU system, as$],[$long as we execute each$],[$concurrent transaction$],[$on a different$],[$core$/$CPU$,],[$execution will always$],[$satisfy the ACID$],[$properties$.]]]],,],[\backslash$table$[[$If a functional$],[$dependency holds on a$],[$schema$,$ it must hold on$],[$all instances of that$],[$schema$.]],,],[\backslash$table$[[$In database design, we$],[$should normalize the$],[$schema into at least$],[3$NF because it is$],[$always possible to do$],[$so$.]],,]]$