Apply the dynamic programming algorithm to map the network in Figure $1($a$),$ using the library

shown in Figure $1($b$).$

$($a$)$

rav, $1$

$3$

mando, $3$

$($b$)$

Figure $1$: $($a$)$ Boolean network to be mapped; $($b$)$ Library of pattern trees.

Clearly indicate all the matches at each node of the network and their cost. Show the mapped

network with best matches and give the final area cost.