For this Question: A movie theater gave you two tables: 
Seats that are available for an upcoming screening and neighboring seats for each seat listed. 
You are asked to find all seats that are adjacent and available for a fixed price. 
Output only distinct pairs of seats in two columns such that the seat with the lower number is always in the first column and the one with the higher number is in the second column.DataFrame/SQL Table with the following schema - 
<schema>[{'name': 'theater_availability', 'columns': [{'name': 'seat_number', 'type': 'int64'}, {'name': 'is_available', 'type': 'bool'}]}, {'name': 'theater_seatmap', 'columns': [{'name': 'seat_number', 'type': 'int64'}, {'name': 'seat_left', 'type': 'float64'}, {'name': 'seat_right', 'type': 'float64'}]}]</schema>Each row in a new line and each value of a row separated by a |, i.e.,
0|1|2
1|2|3
2|3|4-, I have written this Solution Code: WITH adjacent_seats AS
  (SELECT seat_number AS seat,
          seat_left AS adj_seat
   FROM theater_seatmap
   UNION SELECT seat_number AS seat,
                seat_right AS adj_seat
   FROM theater_seatmap)

SELECT seat AS available_seat1,
       adj_seat AS available_seat2
FROM adjacent_seats s
JOIN theater_availability a1 ON s.seat = a1.seat_number
JOIN theater_availability a2 ON s.adj_seat = a2.seat_number
WHERE a1.is_available
  AND a2.is_available
  AND seat < adj_seat, In this Programming Language: SQL, Now tell me if this Code is compilable or not?