The question is on semantic web

Consider the following two RDF graphs: Graph G pb:line1 pb:type "bus"; pb:line-number "174"; pb:number-of-section "54" ; pb:departure "Gambetta"; pb: final-arrival "V.Hugo-Sanzillon" ps: section ps: section-number - num; ps: bus-number "174"; ps: departure "Gambetta"; ps: arrival "Boieldieu". Graph G2 :line 1 pb:type "bus"; pb:line-number "174"; pb final-arrival arrival ps: Section ps: section number secnumber; ps: bus-number "174"; ps: departure "Gambetta". 1. Propose a simple interpretation for the RDF graph G. 2. For each of the graphs G1, G2, demonstrate if it is lean or not lean. (prove your claim) 3. Check whether G F G2? 4. Check whether G2 G? Consider the following two RDF graphs: Graph G pb:line1 pb:type "bus"; pb:line-number "174"; pb:number-of-section "54" ; pb:departure "Gambetta"; pb: final-arrival "V.Hugo-Sanzillon" ps: section ps: section-number - num; ps: bus-number "174"; ps: departure "Gambetta"; ps: arrival "Boieldieu". Graph G2 :line 1 pb:type "bus"; pb:line-number "174"; pb final-arrival arrival ps: Section ps: section number secnumber; ps: bus-number "174"; ps: departure "Gambetta". 1. Propose a simple interpretation for the RDF graph G. 2. For each of the graphs G1, G2, demonstrate if it is lean or not lean. (prove your claim) 3. Check whether G F G2? 4. Check whether G2 G