Converting decision tree into a logical expression 
I need to convert this decision tree into a logical expression by using "and", "or" and "not" logical operators. I have been trying to solve this for 3 days. Any help would be appreciated. 

It's
$$(\neg F \wedge \neg H) \vee (\neg F \wedge H \wedge J) \vee (F \wedge G) \vee (F \wedge \neg G \wedge K)$$
(Here '$\wedge$' means 'and', '$\vee$' means 'or' and '$\neg$' means 'not'.)
