Update Solution.hs (#21)

* Update Solution.hs

the use of the filter function can be avoided,  zipWith already has this built-in, it will only zip a number of times equal to the length of the smaller list. This can only be done because of "Assume that the two lists have the beers in the same order."

* Cleanup

---------

Co-authored-by: Robertino <48034748+rober-m@users.noreply.github.com>

Author: PP144gh

Homework06/Solution.hs

@@ -127,8 +127,6 @@ deliveryCost :: Double
 deliveryCost = 8.50
 
 beerCosts :: [(String, Double)] -> Double
-beerCosts =
-  foldr (+) deliveryCost
-    . zipWith (*) (map snd bevogBeerPrices)
-    . map snd
-    . filter (\name -> fst name `elem` map fst bevogBeerPrices)
+beerCosts = foldl' (+) deliveryCost . zipWith' (\(_, price) (_, qty)  -> price * qty) bevogBeerPrices
+
+