Please type it and if possible write it using the technic used in this example
Extracted text: Consider the relation R(S, N, R, C, J, H, L) and its set of dependencies. F = {S, N -> C ; J, H, C -> L ; J, H, L-> S, N, R ; S, N, R -> J, H, L}. Prove that F E J, H, S, N → Rusing the Armstrong's axioms?
Extracted text: 1) day, hour, courseName, section → day, hour, professorCode Augmentation courseName, section → professorCode 2) day, hour, courseName, section → local Transitivity: day, hour, courseName, section → day, hour, professorCode and day, hour, professorCode → local 3) day, hour, courseName, section → day, hour, local Augmentation courseName, section → local 4) day, hour, courseName, section → courseName, section, meeting Transitivity day, hour, courseName, section → day, hour, local and day, hour, local → courseName, section, meeting 5) courseName, section, meeting → meeting Reflexivity 6) day, hour, courseName, section → meeting Transitivity on 4) and 5) day, hour, courseName, section → courseName, section, meeting and courseName, section, meeting → meeting