Part 1: Use the following schema to answer the questions 1-3 below. This schema refers to a gaming organization. There can be any number of players per game. Each game and each tournament has one...

= "2021-01-01" 2. Write two functionally different relational algebra statements equivalent to the query in 2c. "/>
Extracted text: Part 1: Use the following schema to answer the questions 1-3 below. This schema refers to a gaming organization. There can be any number of players per game. Each game and each tournament has one winner; if the game or tournament is ongoing, the winner is null. The gameWinner and tournamentWinner attributes are foreign keys for memberID. Member (memberlD, memberName, joinDate) Game (gamelD, gameType, gameDate, gameWinner, tournamentName) MemberGame (memberlD, gamelD) Tournament (tournamentName, tournamentWinner) 1. Write a description of what each of the following queries does: a. SELECT FROM Member LEFT OUTER JOIN Tournament ON memberlD = tournamentWinner; b. UPDATE Member SET memberName = "Devon Chance" WHERE memberID = 100154; C. SELECT memberlD, gamelD FROM Member NATURAL JOIN MemberGame NATURAL JOIN Game WHERE joinDate < "2021-01-01"="" and="" gamedate="">= "2021-01-01" 2. Write two functionally different relational algebra statements equivalent to the query in 2c.