'Dicrete Structure of Computer Science'. Topic is : Relations & Database. Please answer all the questions with proper steps. URGNET!!! Thanks

The fifth block (relations and databases) 013 (1 point). Write the operation of relational algebra (in symbolic form) to delete the first, the third and the sixth attribute from the table which schema consists of attributes 0142 points). Explain the following query written using pseudocode operations GET R (Node schema description Node code): SXXChip code) - Node schema descriptionChip code] AND X[Consumed power 110 Explain: a) how many tables are used; b) what are the names of tables; c) what attributes are included in the query. d) what attributes are used for selection of recordsse) what is the result answer to this query? 015) points). Use the given tables WARA Job A 2011 TAH B data 301 CEIT TER TOTERO TUTTO LEO 1 02/07201 Write the sequence of standard table Computing operations to find the performers of the jobs managed by Linde. Mandatory requirements: write the procedure of computation of resulting table in accordance with the query tree . for Cartesian product of tables, give the schema (the domains of the relation) and determine the number of records show the resulting table with all records The fifth block (relations and databases) 013 (1 point). Write the operation of relational algebra (in symbolic form) to delete the first, the third and the sixth attribute from the table which schema consists of attributes 0142 points). Explain the following query written using pseudocode operations GET R (Node schema description Node code): SXXChip code) - Node schema descriptionChip code] AND X[Consumed power 110 Explain: a) how many tables are used; b) what are the names of tables; c) what attributes are included in the query. d) what attributes are used for selection of recordsse) what is the result answer to this query? 015) points). Use the given tables WARA Job A 2011 TAH B data 301 CEIT TER TOTERO TUTTO LEO 1 02/07201 Write the sequence of standard table Computing operations to find the performers of the jobs managed by Linde. Mandatory requirements: write the procedure of computation of resulting table in accordance with the query tree . for Cartesian product of tables, give the schema (the domains of the relation) and determine the number of records show the resulting table with all records