Do Forward Chaining for the CanGetToWork KB below.

You don't need to follow the formal FC algorithm $($with agenda$/$queue and counts array$).$ Just indicate which rules are triggered $($in any order$),$ and keep going until all consequences are generated.

Show the final list of all inferred propositions at the end. Is CanGetToWork among them?

$KB=\{$ a $.$ CanBikeToWork $$ CanGetToWork

b$.$ CanDriveToWork $$ CanGetToWork

c$.$ CanWalkToWWork $$ CanGetToWork

d$.$ HaveBike ${?}^{{?}^{?}}$ WorkCloseToHome ${?}^{{?}^{?}}$ Sunny $$ CanBikeToWork

e$.$ HaveMountainBike $$ HaveBike

f$.$ HaveTenSpeed $$ HaveBike

g$.$ OwnCar $$ CanDriveToWork

h$.$ OwnCar $$ MustGetAnnualInspection

i$.$ OwnCar $$ MustHaveValidLicense

j$.$ CanRentCar $$ CandriveToWork

k$.$ HaveMoney ${?}^{{?}^{?}}$ CarRentalOpen $$ CanRentCar

HertzOpen $$ CarRentalOpen

m$.$ AvisOpen $$ CarRentalOpen

n$.$ EnterpriseOpen $$ CarRentalopen

o$.$ CarRentalOpen $$ IsNotAHoliday

p$.$ HaveMoney ${?}^{{?}^{?}}$ TaxiAvailable $$ CanDriveToWork

q$.$ Sunny ${?}^{{?}^{?}}$ WorkCloseToHome $$ CanWalkToWork

r$.$ HaveUmbrella $^$ WorkCloseToHome $$ CanWalkToWork

s$.$ Sunny $$ StreetsDry $\}$

Facts: $\{$Rainy$,$ HaveMoutainBike, EnjoyPlayingSoccer, WorkForUniversity, WorkCloseToHome, HaveMoney, HertzClosed, AvisOpen, McDonaldsOpen $\}$