Difference between dd-path testing and basis path testing?

I've read lot of resources. But I still don't get the atomic point of differences between both of them. What makes me confuse are:

1) both dd-path and basis path aims for branch coverage. So what is the difference ?

2) DD-path means (branch coverage or C2). Can we call Basis Path C2 ?

3) Most software engineering books (sommerville, pressman) doesn't mention dd-path. most of them use Basis Path. Is dd-path somewhat not used anymore ?

4) It's said that BP(basis path) can cover all statement without all exhausting path. didn't branch coverage of dd-path do the same ?

5) we can get 'independent path' without V(G). We already know how to get it without any formula (just don't repeat the path that already traversed)

6) MCCabe purposed Cyclomatic Complexity in 1976. With original aims for calculating software complexity. Thus if any module exceed the limit. It must be separated. CC doesn't created for software testing until He realize that the value of V(G) can find the 'basis' path in 1996

7) Any of you can give explanation with simple code and test case for dd-path testing and BP testing ?. branch coverage ≤ cyclomatic complexity ≤ number of paths. But any example ? I've seen branch coverage test case simmiliar with BP test case.

I have read pressman, sommervile, lot wikipedia page, slides from various colleges (spent 2-3 days without getting answers. just many scattered points). But I am still can't get the atomic point of difference between them

Thank you very much.