Find all frequent itemsets using Apriori algorithm $($please show all the calculation$).$minimum support $60\%$minimum confident $80\%$ item $1$ m$,$o$,$n$,$k$,$e$,$y

$2$ d $,$o$,$n$,$k$,$e$,$y

$3$ m$,$a$,$k$,$e $4$m$,$u$,$c$,$k$,$y $5$c$,$o$,$o$,$k$,$i$,$e